Please use this identifier to cite or link to this item:
https://rda.sliit.lk/handle/123456789/437| Title: | Review on Maximum Degree Diameter Bounded Subgraph Problem |
| Authors: | Wijerathne, H. M. C Lanel, G. H. J Perera, K. K. K. R |
| Keywords: | Degree Diameter MaxDDBS Optimal subgraph |
| Issue Date: | 25-Sep-2021 |
| Publisher: | Faculty of Humanities and Sciences,SLIIT |
| Series/Report no.: | SICASH 2021;625-632p. |
| Abstract: | 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. |
| URI: | http://localhost:80/handle/123456789/437 |
| ISSN: | 2783-8862 |
| Appears in Collections: | Proceedings of the SLIIT International Conference on Advancements in Sciences and Humanities2021 [SICASH] |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SICASH 2021 - Conference Proceedings(2)-659-666.pdf Until 2050-12-31 | 789.62 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.