- Title
- MaxDDBS problem on Beneš networks
- Creator
- Bong, Novi H.; Ryan, Joe; Sugeng, Kiki A.
- Relation
- Journal of Interconnection Networks Vol. 17, Issue 3-4
- Publisher Link
- http://dx.doi.org/10.1142/S0219265917410031
- Publisher
- World Scientific Publishing
- Resource Type
- journal article
- Date
- 2017
- Description
- Maximum degree-diameter bounded subgraph problem is a problem of constructing the largest possible subgraph of given degree and diameter in a graph. This problem can be considered as a degree-diameter problem restricted to certain host graphs. The MaxDDBS problem with Beneš network as the host graph is discussed in this paper. Beneš network contains a back-to-back buttery network. Even though both networks have maximum degree 4, the structure of their maximum subgraphs are different. We give the constructive lower bound of the largest subgraph of Beneš network of various maximum degrees.
- Subject
- network design; degree diameter problem; Beneš network; MaxDDBS problem
- Identifier
- http://hdl.handle.net/1959.13/1387800
- Identifier
- uon:32665
- Identifier
- ISSN:0219-2659
- Language
- eng
- Reviewed
- Hits: 812
- Visitors: 878
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|