Everything about Greedy embedding
In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications network in order to allow greedy geographic routing to be used to route messages within the network. Although greedy embedding has been proposed for use in wireless sensor networks, in which the nodes already have positions in physical space, these existing positions may differ from the positions given to them by greedy embedding, which may in some cases be points in a virtual space of a higher dimension, or in a non-Euclidean geometry. In this sense, greedy embedding may be viewed as a form of graph drawing, in which an abstract graph is embedded into a geometric space. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Greedy embeddingA 5-minute orientation
- Skim a recent paper: CGES-MAC: Cluster-Based Greedy Embedding MAC Scheduling protocol for underwater acoustic sensor networksInfluential work since 2022
- Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
- Read the landmark paper: Greedy Routing by Network Distance EmbeddingCited 15 times
- Go sideways: Steinitz's theoremA closely related topic
- Go sideways: Circle packing theoremA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Greedy Routing by Network Distance Embedding
A distributed routing for wireless sensor networks with mobile sink based on the greedy embedding
Succinct and practical greedy embedding for geometric routing
On the choice of a spanning tree for greedy embedding of network graphs
DONE: Enhancing network embedding via greedy vertex domination
Secure Data Sharing Framework via Hierarchical Greedy Embedding in Darknets
UW-GRE: Underwater Greedy Geographic Routing by Network Embedding
Sparse large-margin nearest neighbor embedding via greedy dyad functional optimization
🆕 Influential since 2022
đź“š Books worth reading
The Conspirators HierarchyJohn Coleman · 1992
The Steiner ratioDietmar Cieslik · 2001
Computer algorithmsEllis Horowitz · 1997- 📕Proceedings of the International Congress of Mathematicians Madrid, August 22-30, 2006Marta Sanz-Solé, Javier Soria · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Steinitz's theorem In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices…
- Circle packing theorem The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible patterns of tangent circles among non-overlapping…
- Geometric spanner A geometric spanner or a t-spanner graph or a t-spanner was initially introduced as a weighted graph over a set of points as its vertices for which there…
- Spatial network A spatial network (sometimes also geometric graph) is a graph in which the vertices or edges are spatial elements associated with geometric objects, i…
- Graph drawing Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimension…
- Euclidean minimum spanning tree A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system…
- Graph theory In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects…
- Heavy-light decomposition In combinatorial mathematics and theoretical computer science, heavy-light decomposition (also called heavy path decomposition) is a technique for decomposing…