Sciweavers

CORR
2004
Springer

Locally connected spanning trees on graphs

13 years 10 months ago
Locally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CORR
Authors Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
Comments (0)