Fast routing table construction using small messages
Work
Year: 2013
Type: article
Abstract: We describe a distributed randomized algorithm to construct routing tables. Given 0< ε <= 1/2, the algorithm runs in time ~O(n1/2+ε + HD), where n is the number of nodes and HD denotes the diameter of... more
Authors Christoph Lenzen, Boaz Patt-Shamir
Cites: 34
Cited by: 64
Related to: 10
FWCI: 6.813
Citation percentile (by year/subfield): 97.28
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Life on land
Open Access status: green