Parameterized Complexity of the Spanning Tree Congestion Problem

We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class of graphs containing planar graphs, graphs of bounded treewidth, and graphs of...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 64; číslo 1; s. 85 - 111
Hlavní autori:	Bodlaender, Hans L., Fomin, Fedor V., Golovach, Petr A., Otachi, Yota, van Leeuwen, Erik Jan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.09.2012
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Parameterized algorithms Graph minor Apex graph Spanning tree congestion
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!