Space efficient algorithms for directed series–parallel graphs
- 31 August 2006
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 60 (2) , 85-114
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Division in logspace-uniformNC1RAIRO - Theoretical Informatics and Applications, 2001
- A very hard log-space counting classTheoretical Computer Science, 1993
- An Optimal Parallel Algorithm for Formula EvaluationSIAM Journal on Computing, 1992
- Parallel recognition of series-parallel graphsInformation and Computation, 1992
- Computing Algebraic Formulas Using a Constant Number of RegistersSIAM Journal on Computing, 1992
- Parallel Transitive Closure and Point Location in Planar StructuresSIAM Journal on Computing, 1991
- Parallel recognition and decomposition of two terminal series parallel graphsInformation and Computation, 1987
- Problems complete for deterministic logarithmic spaceJournal of Algorithms, 1987
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965