Fast exact algorithms for some connectivity problems parameterized by clique-width

DOI10.1016/j.tcs.2019.02.030zbMath1423.68328arXiv1707.03584MaRDI QIDQ2420640

Mamadou Moustapha Kanté, Benjamin Bergougnoux

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.03584

zbMATH Keywords

connected \(\sigma, \rho\)-domination

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C40: Connectivity