NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
- 1 August 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 4 (3) , 342-354
- https://doi.org/10.1137/0404031
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Efficient Algorithms for Optimization and Selection on Series-Parallel GraphsSIAM Journal on Algebraic Discrete Methods, 1986
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Disjoint Paths—A SurveySIAM Journal on Algebraic Discrete Methods, 1985
- The most reliable series-parallel networksNetworks, 1985
- Networks immune to isolated line failuresNetworks, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Networks immune to isolated failuresNetworks, 1981