Parameterized domination in circle graphs
From MaRDI portal
Publication:2441539
DOI10.1007/s00224-013-9478-8zbMath1286.68222MaRDI QIDQ2441539
Christophe Paul, George B. Mertzios, Ignasi Sau, Daniel Gonçalves, Nicolas Bousquet, Steéphan Thomassé
Publication date: 25 March 2014
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/13452/1/13452.pdf
dynamic programming; parameterized algorithms; parameterized complexity; domination problems; circle graphs; constrained domination
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)