ACO-ARC Seminar: Vijay Vazirani (UC Irvine)

Event Details
  • Date/Time:
    • Thursday November 16, 2017
      1:30 pm - 2:30 pm
  • Location: Skiles 005
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
Contact
No contact information submitted.
Summaries

Summary Sentence: Planar Graph Maximum Matching is in NC (Skiles 005 at 1:30pm)

Full Summary: No summary paragraph submitted.

ACO-ARC Seminar

Vijay Vazirani (UC Irvine)

Thursday, November 16, 2017

Skiles 005, 1:30 pm
 

Title:   Planar Graph Maximum Matching is in NC

Abstract: Is matching in NC, i.e., is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in TCS for over three decades, ever since the discovery of Random NC 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!

The case of bipartite planar graphs was solved by Miller and Naor in 1989 via a flow-based algorithm.  In 2000, Mahajan and Varadarajan gave an elegant way of using counting matchings to finding one, hence giving a different NC algorithm.

However, non-bipartite planar graphs still didn't yield: the stumbling block being odd tight cuts.  Interestingly enough, these are also a key to the solution: a balanced odd tight cut leads to a straight-forward divide and conquer NC algorithm. The remaining task is to find such a cut in NC. This requires several algorithmic ideas, such as finding a point in the interior of the minimum weight face of the perfect matching polytope and uncrossing odd tight cuts.

Joint work with Nima Anari.

Additional Information

In Campus Calendar
No
Groups

ARC

Invited Audience
Faculty/Staff, Public, Graduate students
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Eric Vigoda
  • Workflow Status: Published
  • Created On: Nov 9, 2017 - 8:46am
  • Last Updated: Nov 9, 2017 - 9:12am