Pages that link to "Item:Q5280496"
From MaRDI portal
The following pages link to Succinct Greedy Geometric Routing Using Hyperbolic Geometry (Q5280496):
Displayed 15 items.
- Virtual coordinates in hyperbolic space based on Ricci flow for WLANs (Q279961) (← links)
- Properties of triangulations obtained by the longest-edge bisection (Q403206) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing (Q6039932) (← links)