Space efficient algorithms for directed series–parallel graphs

DOI10.1016/j.jalgor.2004.06.010zbMath1100.68080OpenAlexW1978825460MaRDI QIDQ5491454

Andreas Jakoby, Maciej Liśkiewicz, K. Ruediger Reischuk

Publication date: 5 October 2006

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.06.010

zbMATH Keywords

computational complexityefficient algorithmsalgorithmic graph theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Unnamed Item ⋮ A note on integral generalized flows in directed partial 2-trees ⋮ Cross-series-parallel digraphs ⋮ Memory efficient algorithms for cactus graphs and block graphs ⋮ Algorithms for core stability, core largeness, exactness, and extendability of flow games ⋮ Planar and grid graph reachability problems ⋮ Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs

This page was built for publication: Space efficient algorithms for directed series–parallel graphs