Go to the corresponding LIPIcs Volume Portal |
Grüttemeier, Niels ; Komusiewicz, Christian ; Morawietz, Nils
pdf-format: |
|
@InProceedings{grttemeier_et_al:LIPIcs:2020:12273, author = {Niels Gr{\"u}ttemeier and Christian Komusiewicz and Nils Morawietz}, title = {{Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Susanne Albers}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12273}, URN = {urn:nbn:de:0030-drops-122731}, doi = {10.4230/LIPIcs.SWAT.2020.26}, annote = {Keywords: Graph coloring, social networks, parameterized complexity, kernelization} }
Keywords: | Graph coloring, social networks, parameterized complexity, kernelization | |
Collection: | 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) | |
Issue Date: | 2020 | |
Date of publication: | 12.06.2020 |