Efficient sequential and parallel algorithms for the negative cycle problem

DOI10.1007/3-540-58325-4_190MaRDI QIDQ4525710zbMATH OpenFDO

Authors Dimitris J. Kavvadias, Grammati Pantziou, P. G. Spirakis, Christos Zaroliagis

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_190

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Cited in

(4)

• Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
• Shortest path queries in digraphs of small treewidth
• Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
• Optimal parallel shortest paths in small treewidth digraphs

This page was built for publication: Efficient sequential and parallel algorithms for the negative cycle problem

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