A maximum degree-diameter bounded subgraph problem can be seen as a degree-diameter problem restricted to certain host graphs. In this paper, we investigate the MaxDDBS problem when the host graph is a butterfly network. We give constructive lower bounds for subgraphs of maximum degree 4, 3 and 2.
|Number of pages||20|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - 1 Jan 2017|