Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

CORR
2004
Springer

favoriteEmaildiscussreport

75views Education» more CORR 2004»

Locally connected spanning trees on graphs

13 years 10 months ago

Locally connected spanning trees on graphs

Download math.cts.ntu.edu.tw

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

Real-time Traffic

Connected Subgraph | CORR 2004 | Education | Locally Connected | Spanning Trees |

claim paper

Related Content

» Approximating the Minimum Spanning Tree Weight in Sublinear Time

» An effective genetic algorithm for the minimumlabel spanning tree problem

» The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs

» Greedy Heuristics and an Evolutionary Algorithm for the BoundedDiameter Minimum Spanning T...

» A 53Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs

» A CoarseGrained Parallel Algorithm for Spanning Tree and Connected Components

» On Infinite Cycles I

» Local resilience of almost spanning trees in random graphs

» A Note on Random Minimum Length Spanning Trees

Post Info
More Details (n/a)

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)