Global minimum cuts in surface embedded graphs

Global minimum cuts in surface embedded graphs. Erickson, J., Fox, K., & Nayyeri, A. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1309--1318, 2012.

Paper bibtex

@inproceedings{DBLP:conf/soda/EricksonFN12,
  author    = {Jeff Erickson and
               Kyle Fox and
               Amir Nayyeri},
  title     = {Global minimum cuts in surface embedded graphs},
  booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages     = {1309--1318},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095219&#38;CFID=63838676&#38;CFTOKEN=79617016},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/EricksonFN12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0