Distance Constrained Labelings of Graphs of Bounded Treewidth

Distance Constrained Labelings of Graphs of Bounded Treewidth

We prove that the L(2,1)-labeling problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one from treewidth two. We prove similar results for other variants of the distance co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Automata, Languages and Programming Languages and Programming, 2005, p.360-372
Hauptverfasser: Fiala, Jiří, Golovach, Petr A., Kratochvíl, Jan
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that the L(2,1)-labeling problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one from treewidth two. We prove similar results for other variants of the distance constrained graph labeling problem.
ISSN:0302-9743
1611-3349
DOI:10.1007/11523468_30