Generating paths and cuts in multi-pole (di) graphs. Boros, E., Elbassioni, K., & Gurvich, V. In Fiala, J., Koubek, V., & Kratochvíl, J., editors, MFCS 2004: the 29th International Symposium on Mathematical Foundations of Computer Science, volume 3153, of Lecture Notes in Computer Science, pages 298--309, Prague, Czech Republic, August, 2004. Springer Berlin Heidelberg.
Generating paths and cuts in multi-pole (di) graphs [link]Paper  doi  bibtex   
@inproceedings{ Boros2004a,
  address = {Prague, Czech Republic},
  author = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
  booktitle = {MFCS 2004: the 29th International Symposium on Mathematical Foundations of Computer Science},
  doi = {10.1007/978-3-540-28629-5_21},
  editor = {Fiala, Jiří and Koubek, V́{a}clav and Kratochvíl, Jan},
  file = {:Users/KunihiroWASA/Dropbox/paper/2004/Boros, Elbassioni, Gurvich, Generating paths and cuts in multi-pole (di) graphs, 2004.pdf:pdf},
  month = {August},
  number = {Di},
  pages = {298--309},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{Generating paths and cuts in multi-pole (di) graphs}},
  url = {http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21},
  volume = {3153},
  year = {2004}
}

Downloads: 0