Conflict free version of covering problems on graphs: classical and parameterized
From MaRDI portal
Publication:5915577
DOI10.1007/978-3-319-90530-3_17zbMath1453.68135MaRDI QIDQ5915577
Pranabendu Misra, Pallavi Jain, Lawqueen Kanesh
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
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q27: Parameterized complexity, tractability and kernelization