Planar Graph Perfect Matching is in NC

09/22/2017
by   Nima Anari, et al.
0

Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder than finding one (the former is #P-complete and the latter is in P), and on the other, for planar graphs, counting has long been known to be in NC whereas finding one has resisted a solution. In this paper, we give an NC algorithm for finding a perfect matching in a planar graph. Our algorithm uses the above-stated fact about counting matchings in a crucial way. Several new ideas are needed, such as finding a point in the interior of the minimum weight face of the perfect matching polytope and finding a balanced odd tight set in NC.

READ FULL TEXT
research
09/22/2017

Planar Perfect Matching is in NC

In this paper we show that the problem of computing perfect matchings in...
research
06/01/2021

Excluding a Planar Matching Minor in Bipartite Graphs

Matching minors are a specialisation of minors fit for the study of grap...
research
08/02/2012

Fast Planar Correlation Clustering for Image Segmentation

We describe a new optimization scheme for finding high-quality correlati...
research
01/29/2019

A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching

The difficulty of obtaining an NC perfect matching algorithm has led res...
research
01/29/2019

Matching is as Easy as the Decision Problem, in the NC Model

We give an NC reduction from search to decision for the problem of findi...
research
07/09/2015

Planar Ultrametric Rounding for Image Segmentation

We study the problem of hierarchical clustering on planar graphs. We for...
research
01/31/2018

NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs

In 1988, Vazirani gave an NC algorithm for computing the number of perfe...

Please sign up or login with your details

Forgot password? Click here to reset