Linear-time computability of combinatorial problems on series-parallel graphs
- 1 July 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (3), 623-641
- https://doi.org/10.1145/322326.322328
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Polytope des independants d'un graphe serie-paralleleDiscrete Mathematics, 1979
- Node-Deletion NP-Complete ProblemsSIAM Journal on Computing, 1979
- Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascadeJournal of Combinatorial Theory, Series B, 1978
- Hereditary properties of graphsJournal of Combinatorial Theory, Series B, 1973
- Graphs with forbidden subgraphsJournal of Combinatorial Theory, Series B, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969