scientific article; zbMATH DE number 735432

MaRDI QIDQ4326533zbMATH OpenFDO

Authors Robert Manger

Publication date 2 April 1995

zbMATH Keywords

directed acyclic graphspath problems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Efficient parallel algorithms for path problems in directed graphs
• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 966593
• A parallel algorithm for the maximal path problem
• Parallel Algorithms for Dynamic Shortest Path Problems
• scientific article; zbMATH DE number 4003535
• Parallel algorithms for solving aggregated shortest-path problems
• Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints

Cited in

(10)

• Parallel nested dissection for path algebra computations
• Efficient parallel algorithms for path problems in directed graphs
• Fast and efficient solution of path algebra problems
• scientific article; zbMATH DE number 714465 (Why is no real title available?)
• scientific article; zbMATH DE number 1045663 (Why is no real title available?)
• scientific article; zbMATH DE number 1368817 (Why is no real title available?)
• Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
• scientific article; zbMATH DE number 933173 (Why is no real title available?)
• scientific article; zbMATH DE number 966593 (Why is no real title available?)
• Optimized versions of a distributed algorithm for solving path problems

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 Q4326533)