On the algorithmic complexity of double vertex-edge domination in graphs

DOI10.1007/978-3-030-10564-8_15MaRDI QIDQ5236167zbMATH OpenOpenAlexFDO

Authors H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Publication date 15 October 2019

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-10564-8_15

zbMATH Keywords

APX-completechordal graphdouble vertex-edge dominationNP-completeproper interval graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Double vertex-edge domination in graphs: complexity and algorithms
• Double vertex-edge domination
• Total vertex-edge domination in graphs: Complexity and algorithms
• scientific article; zbMATH DE number 7481760
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

Cited in

(15)

• An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
• Double vertex-edge domination in graphs: complexity and algorithms
• Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
• Vertex-edge domination in cubic graphs
• Total vertex-edge domination in graphs: Complexity and algorithms
• Double vertex-edge domination
• Vertex-edge domination in unit disk graphs
• Vertex-edge domination in unit disk graphs
• On \(k\)-vertex-edge domination of graph
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
• Algorithmic aspects of vertex-edge domination in some graphs.
• The k edge-vertex domination problem
• Algorithmic aspects of total vertex-edge domination in graphs
• The edge-vertex domination and weighted edge-vertex domination problem
• Minimum vertex-edge dominating set of permutation graphs

This page was built for publication: On the algorithmic complexity of double vertex-edge domination in graphs

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