Michael Brinkmeier. Minimum Cuts of Simple Graphs in Almost Always Linear Time. In Sandip Das, Ryuhei Uehara, editors, WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings. Volume 5431 of Lecture Notes in Computer Science, pages 226-237, Springer, 2009. [doi]
Abstract is missing.