Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs - researchr publication

researchr

You are not signed in
Sign in
Sign up

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki. Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. In Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, editors, Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings. Volume 650 of Lecture Notes in Computer Science, pages 400-409, Springer, 1992.

Abstract is missing.

runs on WebDSL