A nearly linear time algorithm for the half integral parity disjoint paths packing problem

Ken-ichi Kawarabayashi, Bruce A. Reed. A nearly linear time algorithm for the half integral parity disjoint paths packing problem. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 1183-1192, SIAM, 2009. [doi]

Abstract

Abstract is missing.