Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, and Philipp Zschoche. Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 53:1-53:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{korenwein_et_al:LIPIcs.ESA.2018.53, author = {Korenwein, Viatcheslav and Nichterlein, Andr\'{e} and Niedermeier, Rolf and Zschoche, Philipp}, title = {{Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {53:1--53:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.53}, URN = {urn:nbn:de:0030-drops-95169}, doi = {10.4230/LIPIcs.ESA.2018.53}, annote = {Keywords: Maximum-cardinality matching, maximum-weight matching, linear-time algorithms, preprocessing, kernelization, parameterized complexity analysis} }
Feedback for Dagstuhl Publishing