Linear-time computability of combinatorial problems on series-parallel graphs-Reference-Cited by-同舟云学术

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

Published:1982-07 Issue:3 Volume:29 Page:623-641
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Takamizawa K.¹,Nishizeki T.²,Saito N.²

Affiliation:

1. C & C Laboratories, Nippon Electric Co Ltd, Kawasaki, Japan 213

2. Department of Electrical Communications, Tohoku University, Sendai, Japan 980

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference22 articles.

1. AHO A V HOPCROFT J E AND ULLMAN J D The Design and Analysis of Computer Algorzthms. Addison-Wesley Reading Mass. 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Design and Analysis of Computer Algorzthms. Addison-Wesley Reading Mass. 1974

2. Polytope des mdependants d'un graphe series-parallel;BOULALA M;Discrete Math,1979

3. CHARTRAND G GELLER D AND HEI)ETNIEMI S Graphs with forbidden subgraphs J Combmatorial Theory 10 (1971) 12-41 CHARTRAND G GELLER D AND HEI)ETNIEMI S Graphs with forbidden subgraphs J Combmatorial Theory 10 (1971) 12-41

4. Topology of series-parallel networks;DUFFIN R J;J Math Apphc,1965

5. EDMONOS J. Paths trees and flowers. Canad d Math. 17 (1965) 449-467. EDMONOS J. Paths trees and flowers. Canad d Math. 17 (1965) 449-467.

Cited by 210 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pipe merging for transient gas network optimization problems;Applied Mathematical Modelling;2025-01

2. Design of survivable networks with low connectivity requirements;International Transactions in Operational Research;2024-07-18

3. Characterizing Flow Complexity in Transportation Networks Using Graph Homology;IEEE Control Systems Letters;2024

4. Packing 2- and 3-stars into cubic graphs;Applied Mathematics and Computation;2024-01

5. The Maximum 4-Vertex-Path Packing of a Cubic Graph Covers At Least Two-Thirds of Its Vertices;Graphs and Combinatorics;2023-12-20