Approximate Maximum Flow on Separable Undirected Graphs

Gary L. Miller, Richard Peng. Approximate Maximum Flow on Separable Undirected Graphs. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1151-1170, SIAM, 2013. [doi]

@inproceedings{MillerP13-0,
  title = {Approximate Maximum Flow on Separable Undirected Graphs},
  author = {Gary L. Miller and Richard Peng},
  year = {2013},
  url = {http://knowledgecenter.siam.org/0236-000039/},
  researchr = {https://researchr.org/publication/MillerP13-0},
  cites = {0},
  citedby = {0},
  pages = {1151-1170},
  booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013},
  editor = {Sanjeev Khanna},
  publisher = {SIAM},
}