More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints
From MaRDI portal
Publication:5009336
DOI10.1137/20M1350571zbMath1475.05160arXiv1805.11275MaRDI QIDQ5009336
Mamadou Moustapha Kanté, Benjamin Bergougnoux
Publication date: 20 August 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.11275
feedback vertex set; clique-width; rank-width; mim-width; connectivity problem; \(\sigma,\rho\)-domination; \(d\)-neighbor equivalence
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
68Q27: Parameterized complexity, tractability and kernelization