Heather Booth and Je#ery Westbrook. A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs. Algorithmica, 11(4):341--352, 1994. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Data-Structural Bootstrapping And Catenable Deques - Buchsbaum (1993) (3 citations) (Correct)
Finding the k Smallest Spanning Trees - Eppstein (1992) (Correct)
Finding a Pathfinder - Reese, Stout (1999) (Correct)
Data-Structural Bootstrapping And Catenable Deques - Buchsbaum (1993) (3 citations) (Correct)
Verification and Sensitivity Analysis Of Minimum Spanning.. - Dixon, Rauch, Tarjan (1992) (27 citations) (Correct)
Finding a Pathfinder - Reese, Stout (Correct)
Data Structural Bootstrapping, Linear Path Compression.. - Buchsbaum, Sundar.. (1992) (Correct)
Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And .. - Frederickson (1991) (52 citations) (Correct)
Improved Algorithms for Replacement Paths Problems in Restricted.. - Bhosle (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC