Abstract
Purchase PDF (275 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
Purchase PDF (166 K)
(
doi:10.1016/j.disc.2004.04.005 
Copyright © 2004 Elsevier B.V. All rights reserved.
Spanning spiders and light-splitting switches*1
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Luisa Garganoa, Mikael Hammara, Pavol Hellb, Ladislav Stacho
, c and Ugo Vaccaroa
Received 28 May 2002;
Abstract
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity.
Author Keywords: Spanning tree; Branch vertex; Hamilton path
Article Outline
then there is a cycle in G that contains all vertices in P.
N−(v0)∩N+(vt).
*1 Research of the first, second and fifth authors was partially supported by the European Community under the RTN project: “Approximation and Randomized Algorithms in Communication Networks (ARACNE)”, and by the Italian Ministry of University and of Scientific Research under the PRIN project: “Resource Allocation in Computer Networks”. Research of the third and fourth authors was supported by NSERC of Canada. This paper is an expansion and coalescence of the two extended abstracts [8] and [9].
