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

DOI10.1007/978-3-642-22685-4_6MaRDI QIDQ3087939zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Minghui Jiang

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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: domination
• The complexity of irredundant sets parameterized by size
• On the parameterized complexity of some optimization problems related to multiple-interval graphs

Cited in

(7)

• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Parameterized Problems on Coincidence Graphs
• Parameterized complexity in multiple-interval graphs: domination
• On the parameterized complexity of multiple-interval graph problems
• Approximation algorithms for intersection graphs

This page was built for publication: Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy

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