Parameterized Complexity in Multiple-Interval Graphs: Domination

DOI10.1007/978-3-642-28050-4_3zbMath1352.68113OpenAlexW1409416370MaRDI QIDQ2891335

Yong Zhang, Ming-Hui Jiang

Publication date: 15 June 2012

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28050-4_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Parameterized domination in circle graphs ⋮ Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy

Cites Work

• Unnamed Item
• Unnamed Item
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• On the parameterized complexity of multiple-interval graph problems
• On recovering syntenic blocks from comparative maps
• Perfect Code is \(W[1\)-complete]
• Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy
• Recognizing d-Interval Graphs and d-Track Interval Graphs
• Scheduling Split Intervals

This page was built for publication: Parameterized Complexity in Multiple-Interval Graphs: Domination