Complexity of network synchronization
Journal of the ACM (JACM)
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Efficient message routing in planar networks
SIAM Journal on Computing
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Distance-dependent distributed directories
Information and Computation
Online tracking of mobile users
Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Distributed Algorithms
Routing in distributed networks: overview and open problems
ACM SIGACT News
Low Complexity Network Synchronization
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the γ-neighborhood of each node. For planar graphs, the cover has radius no more than 24γ-8 and degree (maximum cluster overlaps) no more than 18. For every n node graph that excludes a fixed minor, we present an algorithm that yields a cover with radius no more than 4γ and degree O(log n). This is a significant improvement over previous results for planar graphs and for graphs excluding a fixed minor; in order to obtain clusters with radius of O(γ), it was required to have degree polynomial in n. Since sparse covers have many applications in distributed computing, including compact routing, distributed directories and synchronizers, our improved cover construction results in improved algorithms for all these problems, for the class of graphs that exclude a fixed minor.