An Experimental Study of Minimum Mean Cycle Algorithms

DOI10.1137/1.9781611972894.1zbMath1430.68209OpenAlexW342309696MaRDI QIDQ5233557

Renato F. Werneck, Andrew V. Goldberg, Loukas Georgiadis, Robert Endre Tarjan

Publication date: 11 September 2019

Published in: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972894.1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Unnamed Item ⋮ Finding a contour with the smallest mean expenses in a graph with variable arc lengths. The simplest case ⋮ Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory ⋮ Avoiding or Limiting Regularities in Words ⋮ Unnamed Item ⋮ CROSS cyclic resource-constrained scheduling solver ⋮ About the minimum mean cycle-canceling algorithm

This page was built for publication: An Experimental Study of Minimum Mean Cycle Algorithms