Contraction and treewidth lower bounds.
Bodlaender, Hans L., Wolle, Thomas, Koster, Arie M.C.A. (2006)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Heuristic and metaheuristic methods for computing graph treewidth”
Contraction and treewidth lower bounds.
Theorem proving through depth-first test
Zsolt Tuza (1992)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
A multilevel algorithm for force-directed graph-drawing.
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Approximation algorithms for the maximum induced planar and outerplanar subgraph problems.
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications
Similarity:
Experiments with the fixed-parameter approach for two-layer planarization.
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
An exact performance bound for an time greedy matching procedure.
Shapira, Andrew (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
How to find overfull subgraphs in graphs with large maximum degree. II.
Niessen, Thomas (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On polynomial time decidability of induced-minor-closed classes
Jiří Matoušek, Jaroslav Nešetřil, Robin D. Thomas (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity: