Please use this identifier to cite or link to this item: https://rda.sliit.lk/handle/123456789/437
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWijerathne, H. M. C-
dc.contributor.authorLanel, G. H. J-
dc.contributor.authorPerera, K. K. K. R-
dc.date.accessioned2022-01-03T10:12:11Z-
dc.date.available2022-01-03T10:12:11Z-
dc.date.issued2021-09-25-
dc.identifier.issn2783-8862-
dc.identifier.urihttp://localhost:80/handle/123456789/437-
dc.description.abstractThe 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.en_US
dc.description.sponsorshipFaculty of Humanities & Sciences,SLIITen_US
dc.language.isoenen_US
dc.publisherFaculty of Humanities and Sciences,SLIITen_US
dc.relation.ispartofseriesSICASH 2021;625-632p.-
dc.subjectDegreeen_US
dc.subjectDiameteren_US
dc.subjectMaxDDBSen_US
dc.subjectOptimal subgraphen_US
dc.titleReview on Maximum Degree Diameter Bounded Subgraph Problemen_US
dc.typeArticleen_US
Appears in Collections:Proceedings of the SLIIT International Conference on Advancements in Sciences and Humanities2021 [SICASH]

Files in This Item:
File Description SizeFormat 
SICASH 2021 - Conference Proceedings(2)-659-666.pdf
  Until 2050-12-31
789.62 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.