Empirical analysis of algorithms for the shortest negative cost cycle problem

DOI10.1016/j.dam.2018.03.055zbMath1401.05276OpenAlexW2797804587MaRDI 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

cyclegraph theorysingle source shortest pathdistinct edge widthpath width

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (2)

On the analysis of optimization problems in arc-dependent networks ⋮ On approximating optimal weight ``no-certificates in weighted difference constraint systems

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal length resolution refutations of difference constraint systems
• On the negative cost girth problem in planar networks
• Self-testing/correcting with applications to numerical problems
• Randomized algorithms for finding the shortest negative cost cycle in networks
• Improved algorithms for optimal length resolution refutation in difference constraint systems
• An analysis of totally clairvoyant scheduling
• Automated Reasoning
• Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Fast and Flexible Difference Constraint Propagation for DPLL(T)

This page was built for publication: Empirical analysis of algorithms for the shortest negative cost cycle problem