Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Complexity

CIAC 2017: Algorithms and Complexity pp 285–296Cite as

Cache Oblivious Minimum Cut

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10236))

Abstract

We show how to compute the minimum cut of a graph cache-efficiently. Let B be the width of a cache line and M be the size of the cache. On a graph with V vertices and E edges, we give a cache oblivious algorithm that incurs \(O(\lceil \frac{E}{B} (\log ^4 E) \log _{M/B} E\rceil )\) cache misses and a simpler one that incurs \(O(\lceil \frac{V^2}{B} \log ^3 V\rceil )\) cache misses.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  2. Arge, L., Bender, M.A., Demaine, E.D., Holland-Minkley, B., Ian Munro, J.: An optimal cache-oblivious priority queue and its application to graph algorithms. SIAM J. Comput. 36(6), 1672–1695 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arge, L., Brodal, G.S., Toma, L.: On external-memory MST, SSSP, and multi-way planar graph separation. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 433–447. Springer, Heidelberg (2000). doi:10.1007/3-540-44985-X_37

    Chapter  Google Scholar 

  4. Bhushan, A., Gopalan, S.: I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs. Theor. Comput. Sci. 575, 33–41 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blelloch, G.E., Gibbons, P.B., Simhadri, H.V.: Low depth cache-oblivious algorithms. In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2010, pp. 189–199. ACM, New York (2010)

    Google Scholar 

  6. Brodal, G.S., Fagerberg, R., Meyer, U., Zeh, N.: Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Algorithm Theory - SWAT 2004, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, 8–10 July 2004, pp. 480–492 (2004). doi:10.1007/978-3-540-27810-8_41

  7. Brodal, G.S., Fagerberg, R.: On the limits of cache-obliviousness. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 307–315. ACM, New York (2003)

    Google Scholar 

  8. Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, 22–24 January 1995, pp. 139–149 (1995)

    Google Scholar 

  9. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. ACM Trans. Algorithms 8(1), 4:1–4:22 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Karger, D.R.: Minimum cuts in near-linear time. J. ACM 47(1), 46–76 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601–640 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kawarabayashi, K., Thorup, M.: Deterministic global minimum cut of a simple graph in near-linear time. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14–17 June 2015, pp. 665–674 (2015)

    Google Scholar 

  13. Munagala, K., Ranade, A.: I/O-complexity of graph algorithms. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, Philadelphia, PA, USA, 1999, pp. 687–694. Society for Industrial and Applied Mathematics (1999)

    Google Scholar 

  14. Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discret. Math. 5(1), 54–66 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253–1262 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Silvestri, F.: On the limits of cache-oblivious matrix transposition. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2006. LNCS, vol. 4661, pp. 233–243. Springer, Heidelberg (2007). doi:10.1007/978-3-540-75336-0_15

    Chapter  Google Scholar 

  17. Sleator, D.D., Tarjan R.E.: A data structure for dynamic trees. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, Milwaukee, Wisconsin, USA, 11–13 May 1981, pp. 114–122 (1981)

    Google Scholar 

  18. Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585–591 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, ETH Zurich, Zurich, Switzerland

    Barbara Geissmann & Lukas Gianinazzi

Authors
  1. Barbara Geissmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lukas Gianinazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Barbara Geissmann .

Editor information

Editors and Affiliations

  1. National Technical University of Athens, Zografou, Athens, Greece

    Dimitris Fotakis

  2. National Technical University of Athens, Zografou, Athens, Greece

    Aris Pagourtzis

  3. Université Paris-Dauphine, Paris, France

    Vangelis Th. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Geissmann, B., Gianinazzi, L. (2017). Cache Oblivious Minimum Cut. In: Fotakis, D., Pagourtzis, A., Paschos, V. (eds) Algorithms and Complexity. CIAC 2017. Lecture Notes in Computer Science(), vol 10236. Springer, Cham. https://doi.org/10.1007/978-3-319-57586-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57586-5_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57585-8

  • Online ISBN: 978-3-319-57586-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation