Easy problems for tree-decomposable graphs☆
References (45)
- et al.
Linear Time algorithms for NP-hard problems on graphs embedded in k-trees
Discrete Appl. Math.
(1989) - et al.
Linear time computation of optimal subgraphs of decomposable graphs
J. Algorithms
(1987) - et al.
Complement reducible graphs
Discrete Appl. Math.
(1981) The Monadic Second Order Logic of Graphs. III. Tree-width, Forbidden Minors, and Complexity Issues
Decidable theories
- N. Robertson and P. D. Seymour, Graph minors X,...
- et al.
Graph minors XIII; The disjoint path problem
(Sept. 1986) - et al.
Design and Analysis of Computer Algorithms
(1972) Reduced state enumeration—Another algorithm for reliability evaluation
IEEE Trans. Reliability
(1978)Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey
BIT
(1985)
Complexit of finding embeddings in a k-tree
SIAM J. Algebra Discrete Methods
(1987)
Characterization and recognition of partial 3-trees
SIAM J. Algebra Discrete Methods
(1986)
Nonserial Dynamic Programming
(1972)
Dynamic Programming on Graphs with Bounded Tree-width
Classes of Graphs with Bounded Tree-width
(1986)
NC-Algorithms for Graphs with Bounded Tree-width
(1988)
Planar Graphs with Bounded Treewidth
(1988)
Improved Self-reduction Algorithms from Graphs with Bounded Treewidth
(1988)
Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursively constructed graph families
(July 21, 1988)
Recursively Constructed Graph Families: Membership and Linear Algorithms
A new method for proving lower bounds on the computational complexity of first-order theories, manuscript
(1987)
Cited by (731)
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
2024, Theoretical Computer ScienceTreewidth versus clique number. II. Tree-independence number
2024, Journal of Combinatorial Theory. Series BDeletion to scattered graph classes I - Case of finite number of graph classes
2023, Journal of Computer and System SciencesAllocation of indivisible items with individual preference graphs
2023, Discrete Applied MathematicsDecremental Sensitivity Oracles for Covering and Packing Minors
2024, Leibniz International Proceedings in Informatics, LIPIcsOn a Spectral Lower Bound of Treewidth
2024, IEICE Transactions on Information and Systems
- ☆
Research supported by the Swedish Natural Sciences Research Council and the Swedish Board for Technical Development.
- †
Present address: FB 11/Computer Science, Univerity Dulsburg, Pf 10 15 03, C-W-4100, Dulsburg 1, Germany.
Copyright © 1991 Published by Elsevier Inc.