Minimum Weight Cycles and Triangles: Equivalences and Algorithms
From MaRDI portal
Publication:5495016
DOI10.1109/FOCS.2011.27zbMath1292.05155MaRDI QIDQ5495016
Liam Roditty, Virginia Vassilevska Williams
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (10)
A shortest cycle for each vertex of a graph ⋮ Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs ⋮ Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs ⋮ Improved distance queries and cycle counting by Frobenius normal form ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths ⋮ Unnamed Item ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
This page was built for publication: Minimum Weight Cycles and Triangles: Equivalences and Algorithms
