Conflict free version of covering problems on graphs: classical and parameterized
From MaRDI portal
Publication:5915577
DOI10.1007/978-3-319-90530-3_17zbMath1453.68135OpenAlexW2800520541MaRDI QIDQ5915577
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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Parameterized complexity of conflict-free matchings and paths ⋮ Unnamed Item ⋮ Exploring the Kernelization Borders for Hitting Cycles ⋮ Unnamed Item
This page was built for publication: Conflict free version of covering problems on graphs: classical and parameterized