Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks - researchr publication related

researchr

You are not signed in
Sign in
Sign up

K. Subramani. Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. In Violet R. Syrotiuk, Edgar Chávez, editors, Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, ADHOC-NOW 2005, Cancun, Mexico, October 6-8, 2005, Proceedings. Volume 3738 of Lecture Notes in Computer Science, pages 320-333, Springer, 2005. [doi]

The following publications are possibly variants of this publication:

A mechanical verification of the stressing algorithm for negative cost cycle detection in networksNatarajan Shankar, K. Subramani. SCP, 76(7):609-626, 2011. [doi]

A Zero-Space algorithm for Negative Cost Cycle Detection in networksK. Subramani. jda, 5(3):408-421, 2007. [doi]

runs on WebDSL