论文信息 - MaxDDBS problem on butterfly networks

MaxDDBS problem on butterfly networks

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. ∗ Was also at Department of Mathematics, University of West Bohemia, Pilsen, Czech Republic. Deceased January 2016. N.H. BONG ET AL. /AUSTRALAS. J. COMBIN. 68 (2) (2017), 245–264 246

[1] Albert William,et al. Minimum Cycle Covers of Butterfly and Benes Networks , 2012, SOCO 2012.

[2] Hebert Pérez-Rosés,et al. Degree diameter problem on honeycomb networks , 2014, Discret. Appl. Math..

[3] Premysl Holub,et al. Degree diameter problem on triangular networks , 2015, Australas. J Comb..

[4] Hebert Pérez-Rosés,et al. The Maximum Degree & Diameter-Bounded Subgraph and its Applications , 2012, J. Math. Model. Algorithms.

[5] J. Sirán,et al. Moore Graphs and Beyond: A survey of the Degree/Diameter Problem , 2013 .

[6] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[7] Sachi Hashimoto,et al. Sharper Lower Bounds in the Maximum Degree and Diameter Bounded Subgraph Problem in the Mesh , 2012, 1211.7128.

[8] Hebert Pérez-Rosés,et al. The maximum degree and diameter-bounded subgraph in the mesh , 2012, Discret. Appl. Math..