Search

Showing total 1 results
1 results

1. A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs.

Author

Lin, Ching-Chi, Chen, Gen-Huey, and Chang, Gerard

Subjects
SPANNING trees, INTERSECTION graph theory, ALGORITHMS, MATHEMATICAL optimization, MATHEMATICAL analysis
Abstract

Suppose that T is a spanning tree of a graph G. T is called a locally connected spanning tree of G if for every vertex of T, the set of all its neighbors in T induces a connected subgraph of G. In this paper, given an intersection model of a circular-arc graph, an O( n)-time algorithm is proposed that can determine whether the circular-arc graph contains a locally connected spanning tree or not, and produce one if it exists. [ABSTRACT FROM AUTHOR]

Published
2013
Full Text
View/download PDF