Name
Abstract | ||
|---|---|---|
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point algorithm due to Goldberg, Plotkin, Shmoys and Tardos. An easy observation allows this approach to handle regular bipartite graphs as well. We show, by a careful analysis of the polynomial time algorithm due to Galluccio and Loebl, that the number of perfect matchings in a graph of small (O(log n)) genus can be counted in NC. So perfect matchings in small genus bipartite graphs can also be found via this approach. We then present a different algorithm for finding a perfect matching in a planar bipartite graph. This algorithm is substantially different from the algorithm described above, and also from the algorithm of Miller and Naor, which predates the approach of Goldberg et al. and tackles the same problem. Our new algorithm extends to small genus bipartite graphs, but not to K3,3-free bipartite graphs. We next show that a non-trivial extension of this algorithm allows us to compute a vertex of the fractional perfect matching polytope (such a vertex is either a perfect matching or a half-integral matching) in NC, provided the graph is planar or small genus but not necessarily bipartite, and has a perfect matching to begin with. This extension rekindles the hope for an NC-algorithm to find a perfect matching in a non-bipartite planar graph. � Most results in this paper were originally announced in papers in Proc. 32nd ACM Symposium on Theory of |
Year | Venue | Keywords |
|---|---|---|
2008 | Chicago J. Theor. Comput. Sci. | planar graph,bipartite graph |
Field | DocType | Volume |
Discrete mathematics,Complete bipartite graph,Combinatorics,Bipartite graph,Matching (graph theory),Trivially perfect graph,3-dimensional matching,Perfect graph theorem,Blossom algorithm,Mathematics,Strong perfect graph theorem | Journal | 2008 |
Citations | PageRank | References |
6 | 0.46 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raghav Kulkarni | 1 | 172 | 19.48 |
| Meena Mahajan | 2 | 688 | 56.90 |
| Kasturi Varadarajan | 3 | 1269 | 84.78 |