Abstract
Many graph and network problems are easily solved in the special case of series-parallel networks, but are highly intractable in the general case. This paper considers two complexity measures of two-terminal directed acyclic graphs (st-dags) describing the “distance” of an st-dag from series-parallelity. The two complexity measures are the factoring complexity ψ(G) and the reduction complexity μ(G). Bein, Kamburowski, and Stallmann [3] have shown that ψ(G)≤μ(G)≤n−3, where G is an st-dag with n nodes. They conjectured that ψ(G)=μ(G). This paper gives a proof for this conjecture.
Preview
Unable to display preview. Download preview PDF.
References
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.
W. Bein, P. Brucker, and A. Tamir, Minimum cost flow algorithms for series parallel networks, Discrete Appl. Math., 10 (1985), pp. 117–124.
W. Bein, J. Kamburowski, and F. M. Stallmann, Optimal reductions of two-terminal directed acyclic graphs, SIAM J. Comput., 6 (1992), pp. 1112–1129.
G. Chartrand, D. Geller, and S. Hedetniemi, Graphs with forbidden subgraphs, J. Combinatorial Theory, 10 (1971), pp. 12–41.
R. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl., 10 (1965), pp. 303–318.
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
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
J. S. Provan, The complexity of reliability computations in planar and acyclic graphs, SIAM J. Comput., 15 (1986), pp. 694–702.
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.
J. Valdes, R. Tarjan, and E. Lawler, The recognition of series parallel digraphs, SIAM J. Comput., 11 (1982), pp. 298–313.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naumann, V. (1995). Measuring the distance to series-parallelity by path expressions. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_54
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive