Pages that link to "Item:Q5361912"
From MaRDI portal
The following pages link to Distributed Algorithms for Planar Networks I (Q5361912):
Displaying 10 items.
- Some problems in distributed computational geometry (Q719317) (← links)
- An optimal distributed algorithm for recognizing mesh-connected networks (Q1314373) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- PLANET: a radial layout algorithm for network visualization (Q2164832) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Near-optimal distributed DFS in planar graphs (Q6487493) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)