An algebraic theory of graph reduction
- 1 November 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (5), 1134-1164
- https://doi.org/10.1145/174147.169807
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The nonexistence of reduction rules giving an embedding into a k-treeDiscrete Applied Mathematics, 1994
- Improved self-reduction algorithms for graphs with bounded treewidthDiscrete Applied Mathematics, 1994
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Algorithms finding tree-decompositions of graphsJournal of Algorithms, 1991
- Forbidden minors characterization of partial 3-treesDiscrete Mathematics, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Characterization of partial 3-trees in terms of three structuresGraphs and Combinatorics, 1986
- Linear Algorithms for Isomorphism of Maximal Outerplanar GraphsJournal of the ACM, 1979