An algorithm for prescribed multiple domination in arbitrary graphs

DOI10.1016/S0898-1221(98)00049-2MaRDI QIDQ1608446zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 6 August 2002

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(98)00049-2

zbMATH Keywords

dominationbacktracking algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1792607 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• A note on total domination
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Parallel concepts in graph theory
• Total domination in graphs

Cited in

(2)

• A polyhedral view to a generalization of multiple domination
• An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators

This page was built for publication: An algorithm for prescribed multiple domination in arbitrary graphs

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