A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Philip N. Klein, Sairam Subramanian. A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings. Volume 709 of Lecture Notes in Computer Science, pages 442-451, Springer, 1993.

This author has not been identified. Look up 'Philip N. Klein' in GoogleThis author has not been identified. Look up 'Sairam Subramanian' in Google

runs on WebDSL