@InProceedings{agrawal_et_al:LIPIcs.ICALP.2019.11,
author = {Agrawal, Akanksha and Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket and Tale, Prafullkumar},
title = {{Path Contraction Faster Than 2^n}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.11},
URN = {urn:nbn:de:0030-drops-105874},
doi = {10.4230/LIPIcs.ICALP.2019.11},
annote = {Keywords: path contraction, exact exponential time algorithms, graph algorithms, enumerating connected sets, 3-disjoint connected subgraphs}
}