Skip to search formSkip to main contentSkip to account menu

Greedy embedding

In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Hypergraph is a data structure commonly used to represent connections and relations between multiple objects. Embedding a… 
2016
2016
This paper proposes a novel framework for managing the resource provisioning of reliable virtual networks (VN) in the cloud. This… 
2015
2015
We present a succinct tree coding that enables greedy routing in arbitrary connected graphs. The worst-case length of vertex… 
2012
2012
Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source… 
2012
2012
Resource discovery aims to assist the Virtual Network Provider (VNP) in selecting the best Infrastructure Provider (InP) which… 
2009
2009
We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable… 
2009
2009
A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding… 
Highly Cited
2007
Highly Cited
2007
We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing… 
2006
2006
A greedy embedding of an unweighted undirected graph G = (V, E) into a metric space (X, ρ) is a function f : V → X such that for…