Wijerathne, H. M. CLanel, G. H. JPerera, K. K. K. R2022-01-032022-01-032021-09-252783-8862https://rda.sliit.lk/handle/123456789/437The maximum degree diameter bounded subgraph problem is a quest to find the largest subgraph embedded in a host graph in terms of vertices. The problem is closely related to the decades-old famous Degree Diameter Problem. The problem has been solved for many host graphs in recent years. This article provides a review of all the results obtained in the maximum degree diameter bounded subgraph problem. Furthermore, unsolved problems on these aspects are highlighted for the benefit of new researchers.enDegreeDiameterMaxDDBSOptimal subgraphArticle