Algorithms for the global domination problem

DOI10.1016/J.COR.2024.106876MaRDI QIDQ6979003zbMATH OpenFDO

Authors Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta, F. A. Hernández-Mira

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106876

zbMATH Keywords

computational complexityglobal dominating setgraph theoryheuristic

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Operations research and management science (90Bxx)

Cites work

• A graph approximation heuristic for the vertex cover problem on planar graphs
• A polynomial-time approximation to a minimum dominating set in a graph
• Bounds on the Global Domination Number
• Dominating sets for split and bipartite graphs
• Factor domination in graphs
• Fixed set search applied to the clique partitioning problem
• Global domination in planar graphs
• scientific article; zbMATH DE number 4204392 (Why is no real title available?)
• scientific article; zbMATH DE number 3652386 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Split graphs
• Split Graphs Having Dilworth Number Two
• The generalized independent set problem: polyhedral analysis and solution approaches

This page was built for publication: Algorithms for the global domination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979003)