Algorithmic Aspects of Tree Width
Author:
- B. A. ReedBRB. A. Reed
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 85-107
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsTheoretical Computer Science, 2000
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of GraphsJournal of Algorithms, 1996
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956