Greedy embedding

In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In dynamic graphs, node additions and node/link failures cause coordinate updates and routing failures for greedy geometric…

2016

The back-pressure algorithm (BP) has received much attention for jointly routing and scheduling over multihop networks. The back…

2013

To achieve anonymous and censorship-resistant overlay communication, darknets restrict overlay links to trusted parties…

2013

The k-LSBs multi-bit minimum error replacement (MER) is a method used for embedding multi-bit logo/secret data into k least…

2012

At the core of the Internet, routers are continuously struggling with ever-growing routing and forwarding tables. Although…

2009

Recent advances in networked systems and wireless communications have set the stage for applications with wide-ranging benefits…

2009

Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of…

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…