A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs |
scientific article; zbMATH DE number 563267
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs |
scientific article; zbMATH DE number 563267 |
Statements
A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (English)
0 references
16 June 1994
0 references
sensitivity analysis
0 references
network optimization
0 references
linear algorithm
0 references
planar graphs
0 references
minimum spanning tree
0 references
0 references
