The complexity of searching a graph
Journal of the ACM (JACM)
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
Treewidth for graphs with small chordality
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The diameter of a long-range percolation graph
Random Structures & Algorithms
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximate Distance Labeling Schemes
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Cluster Analysis
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A doubling dimension threshold θ(loglogn) for augmented graph navigability
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Recovering the Long-Range Links in Augmented Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Graph Augmentation via Metric Embedding
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Universal augmentation schemes for network navigability
Theoretical Computer Science
Navigable Small-World networks with few random bits
Theoretical Computer Science
Recovering the long-range links in augmented graphs
Theoretical Computer Science
Deterministic decentralized search in random graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Depth of field and cautious-greedy routing in social networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Non-searchability of random power-law graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On the searchability of small-world networks with arbitrary underlying structure
Proceedings of the forty-second ACM symposium on Theory of computing
A Lower Bound for Network Navigability
SIAM Journal on Discrete Mathematics
Asymptotically optimal solutions for small world graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
Hi-index | 0.00 |
We propose a new perspective on the small world phenomenon by considering arbitrary graphs augmented according to probabilistic distributions guided by tree-decompositions of the graphs. We show that, for any n-node graph G of treewidth ≤ k, there exists a tree-decomposition-based distribution ${\mathcal D}$ such that greedy routing in the augmented graph $(G,{\mathcal D})$ performs in O(klog2n) expected number of steps. We also prove that if G has chordality ≤ k, then the tree-decomposition-based distribution ${\mathcal D}$ insures that greedy routing in $(G,{\mathcal D})$ performs in O((k+log n)log n) expected number of steps. In particular, for any n-node graph G of chordality O(log n) (e.g., chordal graphs), greedy routing in the augmented graph $(G,{\mathcal D})$ performs in O(log2n) expected number of steps.