Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460)
From MaRDI portal
scientific article
| 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 |
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
