scientific article; zbMATH DE number 1689046

MaRDI QIDQ2762791zbMATH OpenFDO

Authors Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk

Publication date 9 January 2002

zbMATH Keywords

path counting problemreachabilityrecognitionseries-parallel graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

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

Cited in

(8)

• Parallel recognition of series-parallel graphs
• The complexity of planarity testing
• Cross-series-parallel digraphs
• Efficient parallel algorithms for series parallel graphs
• Deterministic Dcomposition of Recursive Graph Classes
• scientific article; zbMATH DE number 2086628 (Why is no real title available?)
• Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
• Space efficient algorithms for directed series–parallel graphs

This page was built for publication:

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