Measuring the distance to series-parallelity by path expressions

DOI10.1007/3-540-59071-4_54zbMath1528.68316MaRDI QIDQ6184376

Unnamed Author

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Minimum cost flow algorithms for series-parallel networks
• Topology of series-parallel networks
• Graphs with forbidden subgraphs
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• The Recognition of Series Parallel Digraphs
• Linear-time computability of combinatorial problems on series-parallel graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• On the completeness of a generalized matching problem

This page was built for publication: Measuring the distance to series-parallelity by path expressions