A faster algorithm for finding the minimum cut in a graph
J. Hao, and J. Orlin. Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, page 165--174. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (1992)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 Hao:1992:FAF:139404.139439
%A Hao, Jianxiu
%A Orlin, James B.
%B Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
%C Philadelphia, PA, USA
%D 1992
%I Society for Industrial and Applied Mathematics
%K min-cut
%P 165--174
%T A faster algorithm for finding the minimum cut in a graph
%U http://dl.acm.org/citation.cfm?id=139404.139439
%@ 0-89791-466-X
@inproceedings{Hao:1992:FAF:139404.139439,
acmid = {139439},
added-at = {2013-11-03T04:36:52.000+0100},
address = {Philadelphia, PA, USA},
author = {Hao, Jianxiu and Orlin, James B.},
biburl = {https://www.bibsonomy.org/bibtex/28f7f50a5bc358d7f41d96a75dd34dbca/ytyoun},
booktitle = {Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms},
interhash = {6db7cfe724562420a3b2b079757e783b},
intrahash = {8f7f50a5bc358d7f41d96a75dd34dbca},
isbn = {0-89791-466-X},
keywords = {min-cut},
location = {Orlando, Florida, USA},
numpages = {10},
pages = {165--174},
publisher = {Society for Industrial and Applied Mathematics},
series = {SODA '92},
timestamp = {2013-11-03T04:36:52.000+0100},
title = {A faster algorithm for finding the minimum cut in a graph},
url = {http://dl.acm.org/citation.cfm?id=139404.139439},
year = 1992
}
