A note on contraction degeneracy:

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 re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Wolle, Thomas (VerfasserIn), Koster, Arie M. C. A. (VerfasserIn), Bodlaender, Hans L. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Berlin Konrad-Zuse-Zentrum für Informationstechnik 2004
Schriftenreihe:ZIB-Report 2004,43
Schlagworte:
Zusammenfassung: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."
Beschreibung:19 S. graph. Darst.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!