Decomposing a graph into shortest paths with bounded eccentricity (Q5136231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7278020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing a graph into shortest paths with bounded eccentricity |
scientific article; zbMATH DE number 7278020 |
Statements
25 November 2020
0 references
graph decomposition
0 references
graph clustering
0 references
distance labeling
0 references
BFS
0 references
MESP
0 references
0 references
0.9484648704528807
0 references
0.7583821415901184
0 references
0.7545778155326843
0 references
0.7473029494285583
0 references
0.7142907977104187
0 references
