Parameterized complexity of fair deletion problems

DOI10.1007/978-3-319-55911-7_45MaRDI QIDQ6828076zbMATH OpenFDO

Authors Tomáš Masařík, Tomáš Toufar

Publication date 19 May 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55911-7_45

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

This page was built for publication: Parameterized complexity of fair deletion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828076)