Parameterized Domination in Circle Graphs

DOI10.1007/978-3-642-34611-8_31zbMath1341.05184arXiv1205.3728MaRDI QIDQ5200517

Christophe Paul, George B. Mertzios, Ignasi Sau, Daniel Gonçalves, Nicolas Bousquet, Steéphan Thomassé

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programming; parameterized algorithms; parameterized complexity; domination problems; circle graphs; constrained domination

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C39: Dynamic programming

68W10: Parallel algorithms in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)