Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. Boros, E, Elbassioni, K, Gurvich, V, & Khachiyan, L In Bienstock, D. & Nemhauser, G., editors, ICCO 2004: the 10th International Conference on Integer Programming and Combinatorial Optimization, volume 3064, of Lecture Notes in Computer Science, pages 152--162, New York, NY, USA, June, 2004. Springer Berlin Heidelberg.
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems [link]Paper  doi  bibtex   
@inproceedings{ Boros2004b,
  address = {New York, NY, USA},
  author = {Boros, E and Elbassioni, K and Gurvich, V and Khachiyan, L},
  booktitle = {ICCO 2004: the 10th International Conference on Integer Programming and Combinatorial Optimization},
  doi = {10.1007/978-3-540-25960-2_12},
  editor = {Bienstock, Daniel and Nemhauser, George},
  file = {:Users/KunihiroWASA/Dropbox/paper/2004/Boros et al., Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems, 2004.pdf:pdf},
  month = {June},
  pages = {152--162},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems}},
  url = {http://link.springer.com/chapter/10.1007/978-3-540-25960-2_12},
  volume = {3064},
  year = {2004}
}

Downloads: 0