Near-optimal low-congestion shortcuts on bounded parameter graphs (Q1660932)
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 6919236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal low-congestion shortcuts on bounded parameter graphs |
scientific article; zbMATH DE number 6919236 |
Statements
Near-optimal low-congestion shortcuts on bounded parameter graphs (English)
0 references
16 August 2018
0 references
distributed algorithm
0 references
CONGEST model
0 references
treewidth
0 references
pathwidth
0 references
bounded-genus graph
0 references
minimum spanning tree
0 references
minimum cut
0 references
0.917025864124298
0 references
0.9135318994522096
0 references
0.8502586483955383
0 references
0.848911464214325
0 references
0.8391121029853821
0 references
