L. Sunil Chandran, L. Shankar Ram. On the Number of Minimum Cuts in a Graph. In Oscar H. Ibarra, Louxin Zhang, editors, Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings. Volume 2387 of Lecture Notes in Computer Science, pages 220-229, Springer, 2002. [doi]
@inproceedings{ChandranR02, title = {On the Number of Minimum Cuts in a Graph}, author = {L. Sunil Chandran and L. Shankar Ram}, year = {2002}, url = {http://link.springer.de/link/service/series/0558/bibs/2387/23870220.htm}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/ChandranR02}, cites = {0}, citedby = {0}, pages = {220-229}, booktitle = {Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings}, editor = {Oscar H. Ibarra and Louxin Zhang}, volume = {2387}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-43996-X}, }