A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs

Michael Kaufmann, Gerhard Klär. A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. In Wen-Lian Hsu, Richard C. T. Lee, editors, ISA 91 Algorithms, 2nd International Sy,posium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings. Volume 557 of Lecture Notes in Computer Science, pages 336-348, Springer, 1991.

Abstract

Abstract is missing.