Linear-time computability of combinatorial problems on series-parallel graphs

Journal of the ACM (JACM)

Volumn 29, Issue 3, 1982, Pages 623-641

  Takamizawa, K ^a   Nishizeki, T ^b   Saito, N ^b  

^a NEC CORPORATION   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Edge deletion problem; forbidden graph; generahzed matching problem; series parallel graph; vertex deleuon problem

Indexed keywords

MATHEMATICAL TECHNIQUES;

EID: 0020164101     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322326.322328     Document Type: Article

References (23)

1. Aho, A V, Hopcroft, J E, and Ullman, J D The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Boulala, M, and Uhry, J Polytope des independants d'un graphe series-parallel. Discrete Math 27 (1979), 225-243.
3. Chartrand, G, Geller, D, and Hedetniemi, S Graphs with forbidden subgraphs J Combinatorial Theory 10 (1971), 12-14.
4. Duffin, RJ Topology of series parallel networks. J Math Applic JO (1965), 303-318.
5. Edmonds, J. Paths, trees, and flowers. Canad J Math. 17(1965), 449-467.
6. 25) algorithm for maximum matching in general graphs. Proc 16th IEEE Symp on Foundations of Computer Science, Berkeley, Calif, 1975, pp. 100-112.
7. Garey, M R, Johnson, D S, and Stockmeyer, L Some simplified NP-complete graph problems. Theor. Comput Sci. 1 (1976), 237-267.
8. Hadlock, F.O., Finding a maximum cut of a planar graph in polynomial time SIAM J Comput. 4 (1975), 221-225.
9. Harary, F Graph Theory Addison-Wesley, Reading, Mass., 1969.
10. Hopcroft, J E, and Tarjan, R.E., Dividing a graph into tnconnected components, SIAM J, Comput. 2, 3 (1973), 135-158.
11. Hedetniemi, S T Hereditary properties of graphs J Combinatorial Theory B 14 (1973), 94-99.
12. Kikuno, T, Yoshida, N, and Kakuda, Y Dominating set in planar graphs, Tech, Rep AL79-9, Institute of Electronics and Communication Engineers of Japan, Tokyo, Japan, 1979, pp. 21-30.
13. Kirkpatrick, D G., and Hell, P On the completeness of a generalized matching problem. Proc 10th ACM Symp on Theory of Computing, San Diego, Calif, 1978, pp. 240-245.
14. Krishnamoorthy, M S, and Deo, N. Node-deletion NP-complete problems SIAM J. Comput. 8, 4(1979), 619-625.
15. Lewis, J M On the complexity of the maximum subgraph problem. Proc 10th ACM Symp on Theory of Computing, San Diego, Calif, 1978, pp 265-274.
16. Monma, C L, and Sidney, J B. Sequencing with series-parallel procedure constraints Tech Rep 347, School of Operations Research and Industrial Engineering, Cornell Univ, Ithaca, N.Y, 1979.
17. Moore, E F., and Shannon, C E Reliable circuits using reliable relays, I-II J Franklin Inst 262, 3 (1956), 191, and 4 (1956), 281.
18. Nishizeki, T, and Saito, N Necessary and sufficient condition for a graph to be three-terminal series parallel cascade J Combinatorial Theory B 24, 3 (1978), 344-361.
19. NishizekI, T, Takamizawa, K., and Saito, N. Algorithms for detecting series-parallel graphs and D-charts. Trans Inst Elect Commun. Eng Japan 59, 3 (1976), 259-260.
20. Tomizawa, N. On a specialization sequence from general matroids to ladder graphs with special emphasis on the characterization of ladder matroids. RAAG Research Notes, Third Series, 191, Research Assoc of Applied Geometry, Tokyo, Japan, 1973.
21. Valdes, J., Tarjan, R E, and Lawler, E.L. The recognition of series-parallel digraph. Proc 11th Ann ACM Symp on Theory of Computing, Atlanta, Ga, 1979, pp 1-12.
22. Watanabe, T, Ae, T, and Nakamura, A. On the node cover problem of planar graphs Proc of 1979 Int Symp on Circuits and Systems, Tokyo, Japan, 1979, pp. 78-81.
23. Yannakakis, M Node-and edge-deletion NP-complete problems Proc 10th ACM Symp on Theory of Computing, San Diego, Calif, 1978, pp 253-264.