Dense trees: a new look at degenerate graphs

Journal of Discrete Algorithms

Volumn 4, Issue 3, 2006, Pages 455-474

  Franceschini, Gianni ^a   Luccio, Fabrizio ^a   Pagli, Linda ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Connectivity; Decomposition; Interconnection structures; k degenerate graph; k dense forest; k dense tree; k elimination; k tree; Spanning tree

Indexed keywords

ALGORITHMS; COLORING; DATA STRUCTURES; DECOMPOSITION;

CONNECTIVITY; INTERCONNECTION STRUCTURES; K-DEGENERATE GRAPHS; K-DENSE FORESTS; K-DENSE TREES; K-ELIMINATION; K-TREES; SPANNING TREE;

TREES (MATHEMATICS);

EID: 33747834893     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.12.008     Document Type: Article

References (15)

1. Arbib C., Flammini M., and Nardelli E. How to survive while visiting a graph. Discrete Appl. Math. 99 (2000) 279-293
2. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 (1998) 1-45
3. Diestel R. Graph Theory (2000), Springer-Verlag, New York
4. F. Flores Pacheco, G. Franceschini, F. Luccio, L. Pagli, Decomposition of k-dense, in: Proc. Distributed Data and Structures 3, Carleton Scientific, Ottawa, 2001, pp. 11-23
5. G. Franceschini, Dense tree: una generalizzazione del concetto di albero, Master's Thesis, University of Pisa (2000)
6. Freuder E.C. A sufficient condition for backtrack-free search. J. ACM 29 (1982) 24-32
7. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco, CA
8. Kloks T. Treewidth. Computations and Approximations. Lecture Notes in Computer Science vol. 842 (1994), Springer-Verlag, Berlin
9. Lick D., and White A. k-degenerate graphs. Can. J. Math. 22 (1970) 1082-1096
10. F. Luccio, A. Mesa, L. Pagli, A distributed tree data structure, in: Proc. 1st Internat. Symp. on Advanced Distributed Systems (ISADS2000), Guadalajara, Mexico, 2000, pp. 1-6
11. F. Luccio, L. Pagli, Dense trees: a new structure for interconnection, in: Proc. Distributed Data and Structures 2, Carleton Scientific, Ottawa, 2000, pp. 56-72
12. Matula D.W. A min-max theorem for graphs with applications to graph coloring. SIAM Rev. 10 (1968) 481-482
13. Nardelli E., Proietti G., and Widmaer P. Swapping a failing edge of a single source shortest path tree is good and fast. Algorithmica 35 (2003) 56-74
14. Peterson L.L., and Davie B.S. Computer Networks: A Systems Approach (2003), Morgan Kaufmann, San Francisco, CA
15. Szekeres G., and Wilf H.S. An inequality for the chromatic number of a graph. J. Combin. Theory 4 (1968) 1-3