Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More

We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs. While perfect matchings on planar graphs can be counted exactly in polynomial time, c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Alimohammadi, Yeganeh, Anari, Nima, Shiragur, Kirankumar, Vuong, Thuy-Duong
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Mathematics - Combinatorics Mathematics - Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!