Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Matthew Anderson, Matthew Williamson, K. Subramani. Empirical analysis of algorithms for the shortest negative cost cycle problem. Discrete Applied Mathematics, 253:167-184, 2019. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing AlgorithmK. Subramani, C. Tauras, Kamesh Madduri. amc, 215(10):3563-3575, 2010. [doi] On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in NetworksK. Subramani, Dejan Desovski. iccS 2005: 180-187 [doi] Randomized algorithms for finding the shortest negative cost cycle in networksJames B. Orlin, K. Subramani, Piotr Wojciechowki. DAM, 236:387-394, 2018. [doi]
The following publications are possibly variants of this publication: