APA (7th ed.) Citation

Kaufmann, M., & Klar, G. (1991). A faster algorithm for edge-disjoint paths in planar graphs. Max-Planck-Inst. f. Informatik.

Chicago Style (17th ed.) Citation

Kaufmann, Michael, and Gerhard Klar. A Faster Algorithm for Edge-disjoint Paths in Planar Graphs. Saarbrücken: Max-Planck-Inst. f. Informatik, 1991.

MLA (9th ed.) Citation

Kaufmann, Michael, and Gerhard Klar. A Faster Algorithm for Edge-disjoint Paths in Planar Graphs. Max-Planck-Inst. f. Informatik, 1991.