Pages that link to "Item:Q4575592"
From MaRDI portal
The following pages link to Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut (Q4575592):
Displaying 12 items.
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- 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)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- (Q5090922) (← links)
- (Q5090923) (← links)
- (Q5090925) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
