Path Contraction Faster Than 2^n

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale

Journal title: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

Journal number: 2019

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2019

Published pages: 11:1--11:13

DOI identifier: 10.4230/lipics.icalp.2019.11

ISBN: 978-3-95977-109-2