The Maximum Degree Diameter Bounded Subgraph Problem (MaxDDBS) is a quest to determine the largest subgraph embedded in a given host graph in terms of vertices, subject to the constraints of the ...