Li-Pu Yeh, Biing-Feng Wang. Efficient Algorithms for the kSmallest Cuts Enumeration. In Xiaodong Hu, Jie Wang, editors, Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings. Volume 5092 of Lecture Notes in Computer Science, pages 434-443, Springer, 2008. [doi]
@inproceedings{YehW08, title = {Efficient Algorithms for the kSmallest Cuts Enumeration}, author = {Li-Pu Yeh and Biing-Feng Wang}, year = {2008}, doi = {10.1007/978-3-540-69733-6_43}, url = {http://dx.doi.org/10.1007/978-3-540-69733-6_43}, researchr = {https://researchr.org/publication/YehW08}, cites = {0}, citedby = {0}, pages = {434-443}, booktitle = {Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings}, editor = {Xiaodong Hu and Jie Wang}, volume = {5092}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-69732-9}, }