Negative cycle detection problem

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 652-663

  Wong, Chi Him ^a   Tam, Yiu Cheong ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; RANDOM PROCESSES;

CYCLE GRAPHS; NEGATIVE CYCLE DETECTION PROBLEMS; RANDOM GRAPHS;

PROBLEM SOLVING;

EID: 27144516214     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_58     Document Type: Conference Paper

References (3)

1. [CG96] Boris V. Cherkassky and Andrew V. Goldberg. Negative-cycle detection algorithms. In Josep D'zaz and Maria Serna, editors, Algorithms - ESA '96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 349-363, Barcelona, Spain, 25-27 September 1996. Springer.
2. [Gol95] Andrew V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24(3):494-504, June 1995.
3. [Tar81] R. E. Tarjan. Shortest Paths. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1981.