Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs

Authors:
Xiaofeng Gu;Kamesh Madduri;K. Subramani;Hong-Jian Lai
Affiliations:
Department of Mathematics, West Virginia University, Morgantown;Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley;LDCSEE, West Virginia University, Morgantown;Department of Mathematics, West Virginia University, Morgantown
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 9
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Certifying algorithms for recognizing interval graphs and permutation graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
All Pairs Shortest Paths in Undirected Graphs with Integer Weights

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Implementation of algorithms for maximum matching on nonbipartite graphs.

Implementation of algorithms for maximum matching on nonbipartite graphs.
Does Your Result Checker Really Check?

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A scaling algorithm for weighted matching on general graphs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Shortest Path Algorithms: Engineering Aspects

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we explore the design of algorithms for the problem of checking whether an undirected graph contains a negative cost cycle (UNCCD). It is known that this problem is significantly harder than the corresponding problem in directed graphs. Current approaches for solving this problem involve reducing it to either the b -matching problem or the T -join problem. The latter approach is more efficient in that it runs in O (n 3) time on a graph with n vertices and m edges, while the former runs in O (n 6) time. This paper shows that instances of the UNCCD problem, in which edge weights are restricted to be in the range { *** K ··K } can be solved in O (n 2.75·logn ) time. Our algorithm is basically a variation of the T -join approach, which exploits the existence of extremely efficient shortest path algorithms in graphs with integral positive weights. We also provide an implementation profile of the algorithms discussed.