Empirical analysis of algorithms for the shortest negative cost cycle problem

DOI10.1016/j.dam.2018.03.055zbMath1401.05276MaRDI QIDQ1634773

Y. Aharonov

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.055

zbMATH Keywords

cycle; graph theory; single source shortest path; distinct edge width; path width

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C85: Graph algorithms (graph-theoretic aspects)

05C22: Signed and weighted graphs

Uses Software

• DIMACS