A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

Martin Dietzfelbinger, Hendrik Peilke, Michael Rink. A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. In Ralf Klasing, editor, Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings. Volume 7276 of Lecture Notes in Computer Science, pages 148-159, Springer, 2012. [doi]

Abstract

Abstract is missing.