Parameterized Domination in Circle Graphs

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

Ignasi Sau, George B. Mertzios, Christophe Paul, 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 programmingparameterized algorithmsparameterized complexitydomination problemscircle graphsconstrained domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On dominating set of some subclasses of string graphs

This page was built for publication: Parameterized Domination in Circle Graphs