Recovering sparse graphs
From MaRDI portal
Publication:6291909
DOI10.4230/LIPIcs.MFCS.2018.29zbMath1512.68152arXiv1709.09985MaRDI QIDQ6291909
Publication date: 28 September 2017
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Recovering sparse graphs