Ittai Abraham
ABSTRACT
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removing k shortest paths. Our main result is that every minor free weighted graph is k-path separable. We then show that k-path separable graphs can be used to solve several object location problems: (1) a small-worldization with an average poly-logarithmic number of hops; (2) an (1 + ε)-approximate distance labeling scheme with O(log n) space labels; (3) a stretch-(1 + ε) compact routing scheme with tables of poly-logarithmic space; (4) an (1 + ε)-approximate distance oracle with O(n log n) space and O(log n) query time. Our results generalizes to much wider classes of weighted graphs, namely to bounded-dimension isometric sparable graphs.
- I. Abraham and C. Gavoille, Object location using path separators, Research Report RR-1394-06, LaBRI, University of Bordeaux 1, France, Mar. 2006.]]Google Scholar
Digital Library
- I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi, Routing in networks with low doubling dimension, in 26th International Conference on Distributed Computing Systems (ICDCS), IEEE Computer Society Press, July 2006. To appear.]] Google ScholarDigital Library
- I. Abraham, C. Gavoille, and D. Malkhi, Compact routing for graphs excluding a fixed minor, in 19th International Symposium on Distributed Computing (DISC), vol. 3724 of LNCS, Springer, Sept. 2005, pp. 442--456.]] Google ScholarDigital Library
- ---, On space-stretch trade-offs: Lower bounds, in 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, July 2006.]] Google ScholarDigital Library
- J. Alber, H. Fernau, and R. Niedermeier, Graph separators: A parameterized view, Journal of Computer and System Sciences, 67 (2003), pp. 808--832.]] Google ScholarDigital Library
- N. Alon, P. D. Seymour, and R. Thomas, A separator theorem for graphs with an excluded minor and its applications, in 22nd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 1990, pp. 293--299.]] Google ScholarDigital Library
- ---, Planar separators, SIAM Journal on Discrete Mathematics, 7 (1994), pp. 184--193.]] Google ScholarDigital Library
- B. Awerbuch and D. Peleg, Sparse partitions, in 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Oct. 1990, pp. 503--513.]]Google ScholarDigital Library
- ---, Routing with polynomial communication-space trade-off, SIAM Journal on Discrete Mathematics, 5 (1992), pp. 151--162.]] Google ScholarDigital Library
- H. T.-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou, On hierarchical routing in doubling metrics, in 16th Symposium on Discrete Algorithms (SODA), ACM-SIAM, Jan. 2005.]] Google ScholarDigital Library
- E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, Journal of the ACM, 52 (2005), pp. 866--893.]] Google ScholarDigital Library
- E. D. Demaine and M. Hajiaghayi, Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality, in 15th Symposium on Discrete Algorithms (SODA), ACM-SIAM, Jan. 2005, pp. 682--689.]] Google ScholarDigital Library
- R. Diestel and R. Thomas, Excluding a countable clique, Journal of Combinatorial Theory, Series B, 76 (1999), pp. 41--67.]] Google ScholarDigital Library
- H. N. Djidjev and S. M. Venkatesan, Reduced constants for simple cycle graph separation, Acta Informatica, 34 (1997), pp. 231--243.]]Google ScholarCross Ref
- P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, Could any graph be turned into a small-world?, Research Report 2004-62, LIP, école Normale Supérieure de Lyon, Dec. 2004.]]Google Scholar
- ---, Could any graph be turned into a small-world?, Theoretical Computer Science, 355 (2006), pp. 96--103.]] Google ScholarDigital Library
- U. Feige, M. Hajiaghayi, and J. R. Lee, Improved approximation algorithms for minimum-weight vertex separators, in 37th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 2005.]] Google ScholarDigital Library
- P. Flocchini and F. L. Luccio, A new compact routing technique on series parallel networks, Theory of Computing Systems, 36 (2003), pp. 137--157.]]Google ScholarCross Ref
- P. Fraigniaud, A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs, in 13th Annual European Symposium on Algorithms (ESA), vol. 3669 of LNCS, Springer, Oct. 2005, pp. 791--802.]] Google ScholarDigital Library
- P. Fraigniaud and C. Gavoille, Routing in trees, in 28th International Colloquium on Automata, Languages and Programming (ICALP), vol. 2076 of LNCS, Springer, July 2001, pp. 757--772.]] Google ScholarDigital Library
- G. N. Frederickson and R. Janardan, Designing networks with compact routing tables, Algorithmica, 3 (1988), pp. 171--190.]]Google ScholarDigital Library
- ---, Efficient message routing in planar networks, SIAM Journal on Computing, 18 (1989), pp. 843--857.]] Google ScholarDigital Library
- B. Fu, Theory and application of width bounded geometric separator, in 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 3884 of LNCS, Springer, Feb. 2006, pp. 277--288.]] Google ScholarDigital Library
- C. Gavoille and M. Gengler, Space-efficiency of routing schemes of stretch factor three, Journal of Parallel and Distributed Computing, 61 (2001), pp. 679--687.]] Google ScholarDigital Library
- C. Gavoille, D. Peleg, S. Pérennès, and R. Raz, Distance labeling in graphs, Journal of Algorithms, 53 (2004), pp. 85--112.]] Google ScholarDigital Library
- J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan, A separation theorem for graphs of bounded genus, Journal of Algorithms, 5 (1984), pp. 391--407.]] Google ScholarDigital Library
- M. Grohe, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003), pp. 613--632.]] Google ScholarDigital Library
- A. Gupta, A. Kumar, and R. Rastogi, Traveling with a pez dispenser (or, routing issues in MPLS), SIAM Journal on Computing, 34 (2005), pp. 453--474.]] Google ScholarDigital Library
- J. Kleinberg, The small-world phenomenon: An algorithmic perspective, in 32nd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 2000, pp. 163--170.]] Google ScholarDigital Library
- ---, Complex networks and decentralized search algorithms, in International Congress of Mathematicians (ICM), ACM Press, Aug. 2006. To appear.]]Google Scholar
- T. Kloks, Treewidth: Computations and Approximations, vol. 842 of LNCS, Springer-Verlag, June 1994.]]Google Scholar
- K. A. Laing, Brief announcement: Name-independent compact routing in trees, in 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2004, pp. 382--382.]] Google ScholarDigital Library
- R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM Journal on Applied Mathematics, 36 (1979), pp. 177--189.]]Google ScholarDigital Library
- B. Mohar and C. Thomassen, Graphs on Surfaces, The Johns Hopkins university Press, 2001.]]Google Scholar
- S. A. Plotkin, S. B. Rao, and W. D. Smith, Shallow excluded minors and improved graph decomposition, in 5th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 1994, pp. 462--470.]] Google ScholarDigital Library
- B. Reed and D. R. Wood, A linear time algorithm to find a separation in a graph with an excluded minor, 2005. Full version of EuroComb '05.]]Google Scholar
- N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, 41 (1986), pp. 92--114.]] Google ScholarDigital Library
- ---, Graph minors. XIII. The disjoint paths problem, Journal of Combinatorial Theory, Series B, 63 (1995), pp. 65--110.]] Google ScholarDigital Library
- ---, Graph minors. XVI. Excluding a non-planar graph, Journal of Combinatorial Theory, Series B, 89 (2003), pp. 43--76.]] Google ScholarDigital Library
- N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a planar graph, Journal of Combinatorial Theory, Series B, 62 (1994), pp. 323--348.]] Google ScholarDigital Library
- A. Slivkins, Distance estimation and object location via rings of neighbors, in 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2005, pp. 41--50. Appears earlier as Cornell CIS technical report TR2005-1977.]] Google ScholarDigital Library
- K. Talwar, Bypassing the embedding: Algorithms for low dimensional metrics, in 36th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, June 2004, pp. 281--290.]] Google ScholarDigital Library
- A. Thomason, The extremal function for complete minors, Journal of Combinatorial Theory, Series B, 81 (2001), pp. 318--338.]] Google ScholarDigital Library
- M. Thorup, Compact oracles for reachability and approximate distances in planar digraphs, Journal of the ACM, 51 (2004), pp. 993--1024.]] Google ScholarDigital Library
- M. Thorup and U. Zwick, Approximate distance oracles, Journal of the ACM, 52 (2005), pp. 1--24.]] Google ScholarDigital Library
Index Terms
- Object location using path separators
Recommendations
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Many works related to dually chordal graphs, their cliques and neighborhoods were published by Brandstadt et al. (1998) [1] and Gutierrez (1996) [6]. We will undertake a similar study by considering minimal vertex separators and their properties ...
A Separator Theorem in Minor-Closed Classes
FOCS '10: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer ScienceIt is shown that for each $t$, there is a separator of size $O(t \sqrt{n})$ in any $n$-vertex graph $G$ with no $K_t$-minor. This settles a conjecture of Alon, Seymour and Thomas (J. Amer. Math. Soc., 1990 and STOC'90), and generalizes a result of ...
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceGraph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as Ω(__ __n) in graphs with n vertices. This is the case for planar ...
Comments