%0 Journal Article %1 journals/jal/HaoO94 %A Hao, Jianxiu %A Orlin, James B. %D 1994 %J J. Algorithms %K dblp %N 3 %P 424-446 %T A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. %U http://dblp.uni-trier.de/db/journals/jal/jal17.html#HaoO94 %V 17

@article{journals/jal/HaoO94, added-at = {2018-11-14T00:00:00.000+0100}, author = {Hao, Jianxiu and Orlin, James B.}, biburl = {https://www.bibsonomy.org/bibtex/28b1b9a64c0979ff7b7a588ffc2e79693/dblp}, ee = {https://www.wikidata.org/entity/Q56542247}, interhash = {79d8c9b3e0165537545aac4ca0f2e991}, intrahash = {8b1b9a64c0979ff7b7a588ffc2e79693}, journal = {J. Algorithms}, keywords = {dblp}, number = 3, pages = {424-446}, timestamp = {2018-11-15T12:35:34.000+0100}, title = {A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.}, url = {http://dblp.uni-trier.de/db/journals/jal/jal17.html#HaoO94}, volume = 17, year = 1994 }