Kernelization and Parameterized Complexity of Star Editing and Union Editing
From MaRDI portal
Publication:4909529
DOI10.1007/978-3-642-35261-4_16zbMath1260.68175OpenAlexW8130835MaRDI QIDQ4909529
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_16
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Kernelization and Parameterized Complexity of Star Editing and Union Editing