Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460)
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: Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation |
scientific article; zbMATH DE number 5572548
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation |
scientific article; zbMATH DE number 5572548 |
Statements
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (English)
0 references
30 June 2009
0 references
shortest path
0 references
minor-closed graph classes
0 references
planar graph
0 references
Steiner tree
0 references
Mehlhorn's algorithm
0 references
0 references
0.9190682
0 references
0.89713335
0 references
0.89040506
0 references
0.89037365
0 references
0.8897029
0 references
0.88970274
0 references
0.8889204
0 references
