I. Cahit, R. Cahit
Abstract
In this paper the following problem is considered: given a spanning tree on n vertices, what is the minimum number of edge-deletions and edge-additions needed to transform the spanning tree into an n-vertex (spanning) path? An algorithm is proposed for carrying out this transformation in the minimum number of operations.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper the following problem is considered: given a spanning tree on n vertices, what is the minimum number of edge-deletions and edge-additions needed to transform the spanning tree into an n-vertex (spanning) path? An algorithm is proposed for carrying out this transformation in the minimum number of operations.
Key concepts: Spanning tree, Minimum spanning tree, Shortest-path tree, Minimum degree spanning tree, Combinatorics, Vertex (graph theory), Distributed minimum spanning tree, Enhanced Data Rates for GSM Evolution