Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
Optimizing Cost Flows by Modifying Arc Costs and Capacities
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Creating minimal vertex series parallel graphs from directed acyclic graphs
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
A Note on the Recognition of Nested Graphs
Graph Theory, Computational Intelligence and Thought
BPM '09 Proceedings of the 7th International Conference on Business Process Management
On algebraic expressions of series-parallel and Fibonacci graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Exact counting of Euler tours for generalized series-parallel graphs
Journal of Discrete Algorithms
| Hi-index | 0.01 |
In this paper we develop a new linear-time algorithm for the recognition of series parallel graphs. The algorithm is based on a succinct representation of series parallel graphs for which the presence of an arc can be tested in constant time; space utilization is linear in the number of vertices. We show how to compute such a representation in linear time from a breadth-first spanning tree. Furthermore, we present a precise condition for the existence of such succinct representations in general, which is, for instance, satisfied by planar graphs.