Browsing by Author "Lanel, G. H. J"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    PublicationEmbargo
    Review on Maximum Degree Diameter Bounded Subgraph Problem
    (Faculty of Humanities and Sciences,SLIIT, 2021-09-25) Wijerathne, H. M. C; Lanel, G. H. J; Perera, K. K. K. R
    The 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.