Subquadratic approximation algorithms for clustering problems in high dimensional spaces
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The Local and Global Price of Anarchy of Graphical Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Note: A note on models for graph representations
Theoretical Computer Science
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Compositional competitiveness for distributed algorithms
Journal of Algorithms
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Algorithms and theory of computation handbook
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Local and global price of anarchy of graphical games
Theoretical Computer Science
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On approximate distance labels and routing schemes with affine stretch
DISC'11 Proceedings of the 25th international conference on Distributed computing
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Optimal gossiping with unit size messages in known topology radio networks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
Challenges of computing in mobile cellular environment-a survey
Computer Communications
Space lower bounds for low-stretch greedy embeddings
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
A collection of clustering and decomposition techniques that make possible the construction of sparse and locality-preserving representations for arbitrary networks is presented. The representation method considered is based on breaking the network G(V,E) into connected regions, or clusters, thus obtaining a cover for the network, i.e. a collection of clusters that covers the entire set of vertices V. Several other graph-theoretic structures that are strongly related to covers are discussed. These include sparse spanners, tree covers of graphs and the concepts of regional matchings and diameter-based separators. All of these structures can be constructed by means of one of the clustering algorithms given, and each has proved a convenient representation for handling certain network applications.