1995 | ReviewPaper | Buchkapitel
Measuring the distance to series-parallelity by path expressions
verfasst von : Valeska Naumann
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.