Algorithms – ESA 2005
From MaRDI portal
Publication:5475885
DOI10.1007/11561071zbMath1142.05369OpenAlexW2501059503MaRDI QIDQ5475885
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Fair matchings and related problems ⋮ An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths ⋮ Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory ⋮ An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path ⋮ Approximating the minimum cycle mean ⋮ Maximum weight bipartite matching in matrix multiplication time ⋮ Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths
This page was built for publication: Algorithms – ESA 2005
