Generalized distance domination problems and their complexity on graphs of bounded mim-width
From MaRDI portal
Publication:6298843
DOI10.4230/LIPIcs.IPEC.2018.6zbMath1520.05073arXiv1803.03514MaRDI QIDQ6298843
Jan Arne Telle, Torstein J. F. Strømme, Lars Jaffke, O.-joung Kwon
Publication date: 9 March 2018
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Generalized distance domination problems and their complexity on graphs of bounded mim-width