Results 1 to 10 of about 277 (179)
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L Bodlaender, Arie M C A Koster
exaly +6 more sources
Journal of Combinatorial Theory Series B, 2018 The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
David R Wood
exaly +3 more sources
Some of the next articles are maybe not open access.
Treewidth computations I. Upper bounds
Information and Computation, 2010Hans L Bodlaender, Arie M C A Koster
exaly
Treewidth computations II. Lower bounds
Information and Computation, 2011Hans L Bodlaender, Arie M C A Koster
exaly
The Pathwidth and Treewidth of Cographs
SIAM Journal on Discrete Mathematics, 1993Hans L Bodlaender, Rolf H Möhring
exaly
Treewidth of graphs with balanced separations
Journal of Combinatorial Theory Series B, 2019Zdenek Dvorak, Sergey Norin
exaly
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
ACM Transactions on Algorithms, 2018Fedor V Fomin +2 more
exaly
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics, 2004Erik D Demaine +2 more
exaly
On the complexity of some colorful problems parameterized by treewidth
Information and Computation, 2011Michael R Fellows +2 more
exaly