Approximating spanning tree congestion on graphs with polylog degree (Q7021069)
From MaRDI portal
!
WARNING
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 7990676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating spanning tree congestion on graphs with polylog degree |
scientific article; zbMATH DE number 7990676 |
Statements
Approximating spanning tree congestion on graphs with polylog degree (English)
0 references
28 February 2025
0 references
graph sparsification
0 references
congestion
0 references
bisection
0 references
spanning tree
0 references
