by Fedor V. Fomin, Danil Sagunov, Kirill Simonov
Reference:
Building Large k-Cores from Sparse GraphsFedor V. Fomin, Danil Sagunov, Kirill Simonov45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (Javier Esparza, Daniel Kráľ, eds.), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1–35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
Bibtex Entry:
@InProceedings{FominSS20,
author = {Fedor V. Fomin and Danil Sagunov and Kirill Simonov},
title = {{Building Large k-Cores from Sparse Graphs}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Javier Esparza and Daniel Kr{\'a}ľ},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12702},
URN = {urn:nbn:de:0030-drops-127026},
doi = {10.4230/LIPIcs.MFCS.2020.35},
annote = {Keywords: parameterized complexity, k-core, vertex cover, treewidth}
}