Counting Matchings with k Unmatched Vertices in Planar Graphs

Curticapean, Radu (2016) Counting Matchings with k Unmatched Vertices in Planar Graphs. In: 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs) (57). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 33:1-33:17. ISBN 978-3-95977-015-6 10.4230/LIPIcs.ESA.2016.33

[img] Text
Curticapean_33_3173189_ny.pdf

Download (627kB)
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 29 Jan 2017 20:22
Last Modified: 29 Jan 2017 20:22
URI: http://eprints.sztaki.hu/id/eprint/9028

Update Item Update Item