Maximum Degree Diameter Bounded Subgraph Problem for Square-Octagonal Lattice
The Maximum Degree Diameter Bounded Subgraph Problem (MaxDDBS) is a quest to determine the largest subgraph embedded in a given host graph in terms of vertices, subject to the constraints of the degree and the diameter. This problem can be considered as a restricted version of the degree diameter problem. This paper considers the Square-Octagonal lattice as the host graph and determines the embedded largest subgraphs for all maximum degrees and diameters.
Authors
- K. K. K. R. Perera (ORCID: https://orcid.org/0000-0003-2947-1634)
- G. H. J. Lanel (ORCID: https://orcid.org/0000-0001-5991-6548)
- Chathura Wanigasekara (ORCID: https://orcid.org/0000-0003-4371-6108)
- Himihami Mudiyanselage Chinthaka Wijerathne (ORCID: https://orcid.org/0009-0009-2132-9917)
Institutions
- University of Kelaniya (LK)
- University of Sri Jayewardenepura (LK)
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR) (DE)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/ginotech63460.2025.11076606
- Citations
- 1
- Primary Topic
- Complexity and Algorithms in Graphs
- Type
- article
- Field-Weighted Citation Impact
- 1.50