Locally connected spanning trees on graphs

Simple item page
dc.creatorLin, Ching-Chi
dc.creatorChang, Gerard J.
dc.creatorChen, Gen-Huey
dc.date2004-09-08
dc.date.accessioned2026-07-07T03:21:45Z
dc.date.available2026-07-07T03:21:45Z
dc.descriptionA 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.
dc.description14 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0409013
dc.identifierhttp://arxiv.org/abs/cs/0409013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32326
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.2
dc.titleLocally connected spanning trees on graphs
dc.typetext

Files

Collections

arXiv