by Thomas Wolle, Arie M. C. A. Koster, Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster, Hans L. Bodlaender
http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-042.ps.gz
Add To MetaCart
Abstract:
Abstract. The parameter contraction degeneracy — the maximum minimum degree over all minors of a graph — is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some relationships between the contraction degeneracy and connected components of a graph, blocks of a graph and the genus of a graph. We also look at chordal graphs, and we study an upper bound on the contraction degeneracy. A data structure that can be used for algorithms computing the degeneracy and similar parameters, is also described. 1
Citations
|
866
|
Algorithmic graph theory and perfect graphs
– Golumbic
- 1980
|
|
684
|
Graph Theory
– Harary
- 1969
|
|
368
|
Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms
– Booth, Lueker
- 1976
|
|
319
|
Graph Theory
– Diestel
- 1997
|
|
190
|
A partial k-arboretum of graphs with bounded treewidth
– BODLAENDER
- 1998
|
|
168
|
Efficient planarity testing
– Hopcroft, Tarjan
- 1974
|
|
77
|
Graphs on Surfaces
– Mohar, Thomassen
- 2001
|
|
49
|
Graph Theory and Its Applications
– Gross, Yellen
- 1999
|
|
31
|
The graph genus problem is NP-complete
– Thomassen
- 1989
|
|
28
|
Treewidth: Computational Experiments
– Koster, Bodlaender, et al.
- 2001
|
|
20
|
A complete anytime algorithm for treewidth
– Gogate, Dechter
- 2004
|
|
17
|
Degree-based treewidth lower bounds
– Koster, Wolle, et al.
- 2005
|
|
12
|
Graphs on Surfaces and Their Applications
– Lando, Zvonkin
- 2004
|
|
9
|
Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme
– Scheffler
- 1989
|
|
8
|
Graphes planaires: Reconnaissance et construction des representations planaires topologiques
– Demoucron, Malgrange, et al.
- 1964
|
|
8
|
A note on edge contraction
– Wolle, Bodlaender
|
|
6
|
On Computing Graph Minor Obstruction Sets
– Cattell, Dinneen, et al.
- 1995
|
|
5
|
Contraction degeneracy on cographs
– Bodlaender, Wolle
- 2004
|
|
5
|
Algorithms for VLSI Layout Based on Graph Width Metrics
– Ramachandramurthi
- 1994
|
|
4
|
On determining the genus of a graph in O(v O(g) ) steps
– Filotti, Miller, et al.
- 1979
|
