Low-Congestion Shortcuts for Graphs Excluding Dense Minors (Q6201952)
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 7824200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low-Congestion Shortcuts for Graphs Excluding Dense Minors |
scientific article; zbMATH DE number 7824200 |
Statements
Low-Congestion Shortcuts for Graphs Excluding Dense Minors (English)
0 references
26 March 2024
0 references
congestion
0 references
dilation
0 references
distributed graph algorithms
0 references
low-congestion shortcuts
0 references
minimum spanning tree
0 references
minor-exluded graphs
0 references
planar graphs
0 references
