Pages that link to "Item:Q1660932"
From MaRDI portal
The following pages link to Near-optimal low-congestion shortcuts on bounded parameter graphs (Q1660932):
Displaying 9 items.
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Designing low-congestion networks with structural graph theory (Q2908593) (← links)
- (Q5090925) (← links)
- Minor Excluded Network Families Admit Fast Distributed Algorithms (Q5197712) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Low-congestion shortcut and graph parameters (Q6487542) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)