Parameterized Problems on Coincidence Graphs

DOI10.1007/11940128_27MaRDI QIDQ5459121zbMATH OpenOpenAlexFDO

Authors Sylvain Guillemot

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_27

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the parameterized complexity of multiple-interval graph problems
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
• Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
• Parameterized complexity in multiple-interval graphs: domination
• scientific article; zbMATH DE number 866672

Cited in

(1)

• Parameterized and approximation complexity of the detection pair problem in graphs

This page was built for publication: Parameterized Problems on Coincidence Graphs

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