Pages that link to "Item:Q2575088"
From MaRDI portal
The following pages link to On a conjecture related to geometric routing (Q2575088):
Displayed 41 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Nearly optimal monotone drawing of trees (Q344763) (← links)
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Enumeration of graphs with a heavy-tailed degree sequence (Q895547) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- Manhattan orbifolds (Q1044880) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- Navigation in spatial networks: a survey (Q1782452) (← links)
- An optimal greedy routing algorithm for triangulated polygons (Q1947976) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks (Q2345047) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Succinct strictly convex greedy drawing of 3-connected plane graphs (Q2445876) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Compact Monotone Drawing of Trees (Q3196406) (← links)
- Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints (Q3223916) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Monotone Drawings of 3-Connected Plane Graphs (Q3452836) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- Optimal Monotone Drawings of Trees (Q5351867) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- (Q5743479) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5901462) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)