The following pages link to Distributed Computing (Q5395162):
Displayed 8 items.
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications (Q6202221) (← links)
- Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs (Q6202224) (← links)