Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR20-025 | 20th February 2020 15:07

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs

RSS-Feed




TR20-025
Authors: Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Publication: 24th February 2020 12:15
Downloads: 91
Keywords: 


Abstract:

We show that given an embedding of an O(log n) genus bipartite graph, one can construct an edge weight function in logarithmic space, with respect to which the minimum weight perfect matching in the graph is unique, if one exists.

As a consequence, we obtain that deciding whether the graph has a perfect matching or not is in SPL. In 1999, Reinhardt, Allender and Zhou proved that if one can construct a polynomially bounded weight function for a graph in logspace such that it isolates a minimum weight perfect matching in the graph, then the perfect matching problem can be solved in SPL. In this paper, we give a deterministic logspace construction of such a weight function.



ISSN 1433-8092 | Imprint