Publication: Review on Maximum Degree Diameter Bounded Subgraph Problem
| dc.contributor.author | Wijerathne, H. M. C | |
| dc.contributor.author | Lanel, G. H. J | |
| dc.contributor.author | Perera, K. K. K. R | |
| dc.date.accessioned | 2022-01-03T10:12:11Z | |
| dc.date.available | 2022-01-03T10:12:11Z | |
| dc.date.issued | 2021-09-25 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | Faculty of Humanities & Sciences,SLIIT | en_US |
| dc.identifier.issn | 2783-8862 | |
| dc.identifier.uri | https://rda.sliit.lk/handle/123456789/437 | |
| dc.language.iso | en | en_US |
| dc.publisher | Faculty of Humanities and Sciences,SLIIT | en_US |
| dc.relation.ispartofseries | SICASH 2021;625-632p. | |
| dc.subject | Degree | en_US |
| dc.subject | Diameter | en_US |
| dc.subject | MaxDDBS | en_US |
| dc.subject | Optimal subgraph | en_US |
| dc.title | Review on Maximum Degree Diameter Bounded Subgraph Problem | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- SICASH 2021 - Conference Proceedings(2)-659-666.pdf
- Size:
- 789.63 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: