Sciweavers

159

ISAAC
1992
Springer

186views Algorithms» more ISAAC 1992»

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

15 years 7 months ago

Download www.nishizeki.ecei.tohoku.ac.jp

Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers