"Search Difficulty of Two-Connected Ring-based Topological Network Designs."

Beatrice M. Ombuki-Berman, Mario Ventresca (2007)

> Home

Details and statistics

DOI: 10.1109/FOCI.2007.372179

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/foci/Ombuki-BermanV07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/foci/Ombuki-BermanV07
Beatrice M. Ombuki-Berman, Mario Ventresca:
Search Difficulty of Two-Connected Ring-based Topological Network Designs. FOCI 2007: 267-274

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.