Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy

DOI10.1007/978-3-642-22685-4_6zbMath1348.68067OpenAlexW1576548681MaRDI QIDQ3087939

Yong Zhang, Ming-Hui 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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Parameterized Complexity in Multiple-Interval Graphs: Domination ⋮ Approximation algorithms for intersection graphs ⋮ Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy

This page was built for publication: Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy