Search Difficulty of Two-Connected Ring-based Topological Network Designs. Ombuki-Berman, B. M. & Ventresca, M. In FOCI, pages 267-274, 2007. IEEE.
Search Difficulty of Two-Connected Ring-based Topological Network Designs. [link]Link  Search Difficulty of Two-Connected Ring-based Topological Network Designs. [link]Paper  bibtex   
@inproceedings{conf/foci/Ombuki-BermanV07,
  added-at = {2017-05-17T00:00:00.000+0200},
  author = {Ombuki-Berman, Beatrice M. and Ventresca, Mario},
  biburl = {https://www.bibsonomy.org/bibtex/28a7a373f09cd9a8fc858951763c75310/dblp},
  booktitle = {FOCI},
  crossref = {conf/foci/2007},
  ee = {https://doi.org/10.1109/FOCI.2007.372179},
  interhash = {ce49b8b5b6f3887e0d141d132c740ac9},
  intrahash = {8a7a373f09cd9a8fc858951763c75310},
  isbn = {1-4244-0703-6},
  keywords = {dblp},
  pages = {267-274},
  publisher = {IEEE},
  timestamp = {2019-10-17T22:12:27.000+0200},
  title = {Search Difficulty of Two-Connected Ring-based Topological Network Designs.},
  url = {http://dblp.uni-trier.de/db/conf/foci/foci2007.html#Ombuki-BermanV07},
  year = 2007
}

Downloads: 0