Turbocharging Treewidth Heuristics
- 17 August 2018
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 81 (2) , 439-475
Abstract
No abstract availableKeywords
Funding Information
- Australian Research Council (FT140100048, DP150101134)
- Australian Research Council (DP180102870)
This publication has 7 references indexed in Scilit:
- Dynamic dominating set and turbo-charging greedy heuristicsTsinghua Science and Technology, 2014
- Incremental list coloring of graphs, parameterized by conservationTheoretical Computer Science, 2013
- Treewidth computations I. Upper boundsInformation and Computation, 2010
- Treewidth: Computational ExperimentsElectronic Notes in Discrete Mathematics, 2001
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987