Complexity and algorithms for semipaired domination in graphs

DOI10.1007/978-3-030-25005-8_23MaRDI QIDQ6830393zbMATH OpenFDO

Authors Michael A. Henning, Arti Pandey, Vikash Tripathi

Publication date 25 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmbipartite graphschordal graphsdominationgraph algorithminterval graphsNP-completesemipaired domination

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

This page was built for publication: Complexity and algorithms for semipaired domination in graphs

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