Locally connected spanning trees on graphs

Details Locally connected spanning trees on graphs Locally connected spanning trees on graphs

2004-09-08

arxiv.org/abs/cs/0409013v1

Computer Science

Data Structures and Algorithms

14 pages, 3 figures

Scientific paper

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\in 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.

Affiliated with

Also associated with

No associations

Rating

Locally connected spanning trees on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Locally connected spanning trees on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locally connected spanning trees on graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-343724