Total Outer-Independent Domination Number: Bounds and Algorithms

Total Outer-Independent Domination Number: Bounds and Algorithms

In graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><...

Full description

Saved in:
Bibliographic Details
Main Authors: Paul Bosch, Ernesto Parra Inza, Ismael Rios Villamar, José Luis Sánchez-Santiesteban
Format: Article
Language:English
Published: MDPI AG 2025-03-01
Series:Algorithms
Subjects:
graph theory
total outer-independent dominating set
integer linear program
heuristic algorithm
time complexity
Online Access:https://www.mdpi.com/1999-4893/18/3/159
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/1999-4893/18/3/159

Similar Items