Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths

Andreas Schwill. Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths. In Christian Choffrut, Thomas Lengauer, editors, STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings. Volume 415 of Lecture Notes in Computer Science, pages 250-262, Springer, 1990.

Abstract

Abstract is missing.