Decomposing a graph into shortest paths with bounded eccentricity (Q777405)
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: Decomposing a graph into shortest paths with bounded eccentricity |
scientific article; zbMATH DE number 7218282
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing a graph into shortest paths with bounded eccentricity |
scientific article; zbMATH DE number 7218282 |
Statements
Decomposing a graph into shortest paths with bounded eccentricity (English)
0 references
7 July 2020
0 references
graph decomposition
0 references
graph clustering
0 references
distance labeling
0 references
BFS
0 references
MESP
0 references
0 references
