Compressing Bounded Degree Graphs
From MaRDI portal
Publication:2802953
DOI10.1007/978-3-662-49529-2_27zbMath1475.68238OpenAlexW2469022530MaRDI QIDQ2802953
No author found.
Publication date: 3 May 2016
Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_27
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} ⋮ Cutting a tree with subgraph complementation is hard, except for some small trees
This page was built for publication: Compressing Bounded Degree Graphs
