Parameterized complexity in multiple-interval graphs: domination

DOI10.1007/978-3-642-28050-4_3MaRDI QIDQ2891335zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Minghui 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

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

Recommendations

• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
• On the parameterized complexity of multiple-interval graph problems
• Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
• Parameterized Complexity of Generalized Domination Problems
• Parameterized complexity of generalized domination problems

Cites work

• Fixed-parameter tractability and completeness II: On completeness for W[1]
• scientific article; zbMATH DE number 921905 (Why is no real title available?)
• On recovering syntenic blocks from comparative maps
• On the parameterized complexity of multiple-interval graph problems
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Optimization problems in multiple-interval graphs
• Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
• Perfect Code is \(W[1]\)-complete
• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
• Scheduling Split Intervals

Cited in

(15)

• On the parameterized complexity of multiple-interval graph problems
• The complexity of dominating set in geometric intersection graphs
• On the parameterized complexity of \([1,j]\)-domination problems
• Approximability and parameterized complexity of multicover by \(c\)-intervals
• Parameterized domination in circle graphs
• k-gap interval graphs
• Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• The dominating set problem in geometric intersection graphs
• The parameterized complexity of domination-type problems and application to linear codes
• Parameterized Problems on Coincidence Graphs
• Parameterized Complexity of Generalized Domination Problems
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
• Parameterized dominating set problem in chordal graphs: Complexity and lower bound

This page was built for publication: Parameterized complexity in multiple-interval graphs: domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891335)