Cache Oblivious Minimum Cut

Barbara Geissmann, Lukas Gianinazzi. Cache Oblivious Minimum Cut. In Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos, editors, Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Volume 10236 of Lecture Notes in Computer Science, pages 285-296, 2017. [doi]

@inproceedings{GeissmannG17,
  title = {Cache Oblivious Minimum Cut},
  author = {Barbara Geissmann and Lukas Gianinazzi},
  year = {2017},
  doi = {10.1007/978-3-319-57586-5_24},
  url = {https://doi.org/10.1007/978-3-319-57586-5_24},
  researchr = {https://researchr.org/publication/GeissmannG17},
  cites = {0},
  citedby = {0},
  pages = {285-296},
  booktitle = {Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings},
  editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos},
  volume = {10236},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-319-57586-5},
}