Space efficient algorithms for directed series–parallel graphs

DOI10.1016/J.JALGOR.2004.06.010MaRDI QIDQ5491454zbMATH OpenOpenAlexFDO

Authors Andreas Jakoby, Maciej Liśkiewicz, Rüdiger 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

algorithmic graph theorycomputational complexityefficient algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1689046
• scientific article; zbMATH DE number 2086628
• Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
• Parallel algorithms for series parallel graphs
• Parallel recognition of series-parallel graphs

Cited in

(11)

• Cross-series-parallel digraphs
• A note on integral generalized flows in directed partial 2-trees
• Algorithms for core stability, core largeness, exactness, and extendability of flow games
• scientific article; zbMATH DE number 1689046 (Why is no real title available?)
• scientific article; zbMATH DE number 140481 (Why is no real title available?)
• scientific article; zbMATH DE number 2086628 (Why is no real title available?)
• scientific article; zbMATH DE number 7378361 (Why is no real title available?)
• Memory efficient algorithms for cactus graphs and block graphs
• Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
• Space-efficient algorithms for reachability in directed geometric graphs
• Planar and grid graph reachability problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491454)