Pages that link to "Item:Q5212756"
From MaRDI portal
The following pages link to Planar diameter via metric compression (Q5212756):
Displayed 7 items.
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6148068) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← 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)