MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
From MaRDI portal
Publication:5249044
DOI10.1142/S0129054100000272zbMath1320.05121OpenAlexW2076721115MaRDI QIDQ5249044
Jan Arne Telle, Magnús M. Halldórsson, Jan Kratochvíl
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054100000272
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Parameterized complexity of generalized domination problems, On weak odd domination and graph-based quantum secret sharing, Sort and Search: exact algorithms for generalized domination, On the complexity of finding large odd induced subgraphs and odd colorings
Cites Work