Measuring the distance to series-parallelity by path expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 903, Issue , 1995, Pages 269-281

  Naumann, Valeska ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

COMPLEXITY MEASURES; DIRECTED ACYCLIC GRAPH (DAG); NETWORK PROBLEMS; PARALLELITY; PATH EXPRESSIONS; SERIES-PARALLEL; TWO TERMINALS;

COMPLEX NETWORKS;

EID: 84947930798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59071-4_54     Document Type: Conference Paper

References (10)

1. A. Agrawal and A. Satyanarayana, An O(|E|) time algorithm for computing the reliability of a class of directed networks, Oper. Res., 32 (1984), pp. 493-515.
2. W. Bein, R Brucker, and A. Tamir, Minimum cost flow algorithms for series parallel networks, Discrete Appl. Math., 10 (1985), pp. 117-124.
3. W. Bein, J. Kamburowski, and F. M. Stallmann, Optimal reductions of two-terminal directed acyclic graphs, SIAM J. Comput., 6 (1992), pp. 1112-1129.
4. G. Chartrand, D. Geller, and S. Hedetniemi, Graphs with forbidden subgraphs, J. Combinatorial Theory, 10 (1971), pp. 12-41.
5. R. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl., 10 (1965), pp. 303-318.
6. D. G. Kirkpatrick, and P. Hell, On the completeness of a generalized matching problem, Proc. 10th ACM Symp. on Theory of Computing, San Diego, Calif., 1978, pp. 265-274
7. R. H. Möhring, Computationally tractable classes of ordered sets, In: I. Rival, ed., Algorithms and Order, Kluwer Acad. Publ.; Dordrecht, 1989, pp. 105-194
8. J. S. Provan, The complexity of reliability computations in planar and acyclic graphs, SIAM J. Comput., 15 (1986), pp. 694-702.
9. K. Takamizawa, T. Nishizeki, and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs, J. Assoc. Comput. Mach., 29 (1982), pp. 623-641.
10. J. Valdes, R. Tarjan, and E. Lawler, The recognition of series parallel digraphs, SIAM J. Comput., 11 (1982), pp. 298-313.