Efficient algorithms for the problems of enumerating cuts by non-decreasing weights. Yeh, Pu, L., Wang, Feng, B., Su, & Hao, H. Algorithmica, 56(3):297--312, 2010.
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights [link]Paper  doi  bibtex   
@article{ Yeh2010,
  author = {Yeh, Li Pu and Wang, Biing Feng and Su, Hsin Hao},
  doi = {10.1007/s00453-009-9284-5},
  file = {:Users/KunihiroWASA/Dropbox/paper/2010/Yeh, Wang, Su, Efficient algorithms for the problems of enumerating cuts by non-decreasing weights, 2010.pdf:pdf},
  isbn = {0045300992},
  issn = {01784617},
  journal = {Algorithmica},
  keywords = {Algorithms,Enumeration,Graphs,Maximum flows,Minimum cuts,Suboptimal cuts},
  number = {3},
  pages = {297--312},
  title = {{Efficient algorithms for the problems of enumerating cuts by non-decreasing weights}},
  url = {http://link.springer.com/article/10.1007/s00453-009-9284-5},
  volume = {56},
  year = {2010}
}

Downloads: 0