Pathwidth of cubic graphs and exact algorithms
- 1 March 2006
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 97 (5) , 191-196
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A note on the complexity of minimum dominating setJournal of Discrete Algorithms, 2006
- Algorithms Based on the Treewidth of Sparse GraphsLecture Notes in Computer Science, 2005
- New spectral lower bounds on the bisection width of graphsTheoretical Computer Science, 2004
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUTDiscrete Applied Mathematics, 2003
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Paths, Stars and the Number ThreeCombinatorics, Probability and Computing, 1996
- The Vertex Separation and Search Number of a GraphInformation and Computation, 1994
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986