Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time

Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen. Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 601-610, IEEE Computer Society, 2010. [doi]

@inproceedings{BorradaileSW10,
  title = {Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time},
  author = {Glencora Borradaile and Piotr Sankowski and Christian Wulff-Nilsen},
  year = {2010},
  doi = {10.1109/FOCS.2010.63},
  url = {http://dx.doi.org/10.1109/FOCS.2010.63},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BorradaileSW10},
  cites = {0},
  citedby = {0},
  pages = {601-610},
  booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-4244-7},
}