Counting Matchings with k Unmatched Vertices in Planar Graphs

Radu Curticapean. Counting Matchings with k Unmatched Vertices in Planar Graphs. In Piotr Sankowski, Christos D. Zaroliagis, editors, 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark. Volume 57 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

Abstract

Abstract is missing.