Conflict free version of covering problems on graphs: classical and parameterized

DOI10.1007/978-3-319-90530-3_17MaRDI QIDQ5915577zbMATH OpenOpenAlexFDO

Authors Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra

Publication date 28 November 2018

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-90530-3_17

zbMATH Keywords

conflict-freenesshereditary propertieskernelizationparameterized algorithmsvertex cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Conflict free version of covering problems on graphs: classical and parameterized
• Conflict free feedback vertex set: a parameterized dichotomy
• Parameterized complexity of conflict-free set cover
• Parameterized complexity of conflict-free set cover
• Parameterized complexity of conflict-free matchings and paths

Cited in

(9)

• Parameterized complexity of conflict-free matchings and paths
• Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
• Conflict free feedback vertex set: a parameterized dichotomy
• Exploring the kernelization borders for hitting cycles
• Parameterized complexity of conflict-free matchings and paths
• Parameterized complexity of conflict-free set cover
• Conflict free version of covering problems on graphs: classical and parameterized
• Parameterized complexity of conflict-free set cover
• On conflict-free cuts: algorithms and complexity

This page was built for publication: Conflict free version of covering problems on graphs: classical and parameterized

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