Skip to main content
Log in

Strong-Diameter Decompositions of Minor Free Graphs

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We provide the first sparse covers and probabilistic partitions for graphs excluding a fixed minor that have strong diameter bounds; i.e. each set of the cover/partition has a small diameter as an induced sub-graph. Using these results we provide improved distributed name-independent routing schemes. Specifically, given a graph excluding a minor on r vertices and a parameter ρ>0 we obtain the following results: (1) a polynomial algorithm that constructs a set of clusters such that each cluster has a strong-diameter of O(r 2 ρ) and each vertex belongs to 2O(r) r! clusters; (2) a name-independent routing scheme with a stretch of O(r 2), headers of O(log n+rlog r) bits, and tables of size 2O(r) r! log 4 n/log log n bits; (3) a randomized algorithm that partitions the graph such that each cluster has strong-diameter O(r6r ρ) and the probability an edge (u,v) is cut is O(rd(u,v)/ρ).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abraham, I., Gavoille, C.: Object location using path separators. In: 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 188–197. ACM Press, New York (2006)

    Google Scholar 

  2. Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: 18th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 3274, pp. 305–319. Springer, Berlin (2004)

    Google Scholar 

  3. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 20–24. ACM Press, New York (2004)

    Google Scholar 

  4. Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: 19th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 3724, pp. 442–456. Springer, Berlin (2005)

    Google Scholar 

  5. Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Lower bounds. In: 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 217–224. ACM Press, New York (2006)

    Google Scholar 

  6. Awerbuch, B., Peleg, D.: Locality-sensitive resource allocation. Technical Report CS90-27, Weizmann Institute, November 1990

  7. Awerbuch, B., Peleg, D.: Network synchronization with polylogarithmic overhead. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 514–522 (1990)

  8. Awerbuch, B., Peleg, D.: Sparse partitions. In: 31th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503–513. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  9. Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. Discrete Math. 5(2), 151–162 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. Busch, C., LaFortune, R., Tirthapura, S.: Improved sparse covers for graphs excluding a fixed minor. In: 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 61–70. ACM Press, New York (2007)

    Google Scholar 

  11. Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: STOC ’05: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 494–503. ACM Press, New York (2005)

    Chapter  Google Scholar 

  12. Fakcharoenphol, J., Talwar, K.: An improved decomposition theorem for graphs excluding a fixed minor. In: RANDOM-APPROX, pp. 36–46 (2003)

  13. Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 682–690. ACM Press, New York (1993)

    Google Scholar 

  14. Thomason, A.: The extremal function for complete minors. J. Comb. Theory, Ser. B 81(2), 318–338 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mikkel, T.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993–1024 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1–24 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cyril Gavoille.

Additional information

C. Gavoille is supported by the projects ‘GeoComp” and “Alpage”of the ACI Masses de Données.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abraham, I., Gavoille, C., Malkhi, D. et al. Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput Syst 47, 837–855 (2010). https://doi.org/10.1007/s00224-010-9283-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9283-6

Keywords

Navigation