Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. Borradaile, G., Sankowski, P., & Wulff-Nilsen, C. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, Nevada, USA, October 23-26, 2010, pages 601–610, 2010.
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time [link]Paper  doi  bibtex   4 downloads  
@inproceedings{DBLP:conf/focs/BorradaileSW10,
  author       = {Glencora Borradaile and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing
                  Time},
  booktitle    = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2010, Las Vegas, Nevada, USA, October 23-26, 2010},
  pages        = {601--610},
  year         = {2010},
  crossref     = {DBLP:conf/focs/2010},
  url          = {https://doi.org/10.1109/FOCS.2010.63},
  doi          = {10.1109/FOCS.2010.63},
  timestamp    = {Tue, 08 Jul 2025 16:36:37 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/BorradaileSW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 4