Cache Oblivious Minimum Cut. Geissmann, B. & Gianinazzi, L. In Fotakis, D., Pagourtzis, A., & Paschos, V. T., 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.
Cache Oblivious Minimum Cut [link]Paper  doi  bibtex   
@INPROCEEDINGS{GeissmannG2017IP,
  author = {Barbara Geissmann and Lukas Gianinazzi},
  title = {{C}ache {O}blivious {M}inimum {C}ut},
  booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
	2017, Athens, Greece, May 24-26, 2017, Proceedings},
  year = {2017},
  editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos},
  volume = {10236},
  series = {Lecture Notes in Computer Science},
  pages = {285--296},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl = {http://dblp.org/rec/bib/conf/ciac/GeissmannG17},
  doi = {10.1007/978-3-319-57586-5_24},
  timestamp = {Wed, 10 May 2017 15:26:01 +0200},
  url = {https://doi.org/10.1007/978-3-319-57586-5_24}
}

Downloads: 0