Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315)
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: Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem |
scientific article |
Statements
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (English)
0 references
1 February 2017
0 references
graph search
0 references
graph theory
0 references
eccentricity
0 references
diameter
0 references
BFS
0 references
approximation algorithms
0 references
\(k\)-laminar graph
0 references
