On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection

DOI10.1016/j.amc.2005.04.005zbMath1092.90055OpenAlexW2072049592MaRDI QIDQ2489173

D. Desovski, K. Subramani and Vahan Mkrtchyan

Publication date: 16 May 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.005

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (1)

Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm

Uses Software

• LEDA

Cites Work

• Temporal constraint networks
• Scheduling real-time computations with separation constraints
• Shortest paths algorithms: Theory and experimental evaluation
• A heuristic improvement of the Bellman-Ford algorithm
• Shortest‐path methods: Complexity, interrelations and new propositions
• A Unified Approach to Path Problems
• Fast Algorithms for Solving Path Problems
• Regular Algebra Applied to Path-finding Problems
• Dual algorithms for the shortest path tree problem
• Negative-cycle detection algorithms
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Scaling Algorithms for the Shortest Paths Problem
• An Algebra for Network Routing Problems
• Combinatorial optimization. Theory and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection