Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs

Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs

Authors Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran



PDF
Thumbnail PDF

File

LIPIcs.STACS.2011.579.pdf
  • Filesize: 0.68 MB
  • 12 pages

Document Identifiers

Author Details

Samir Datta
Raghav Kulkarni
Raghunath Tewari
N. Variyam Vinodchandran

Cite As Get BibTex

Samir Datta, Raghav Kulkarni, Raghunath Tewari, and N. Variyam Vinodchandran. Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 579-590, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011) https://doi.org/10.4230/LIPIcs.STACS.2011.579

Abstract

We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a perfect matching or not and (2) a unique perfect matching or not, are in the logspace complexity class SPL.  Since SPL is contained in the logspace counting classes oplus L (in fact in mod_k for all k >= 2), C=L, and PL, our upper bound places the above-mentioned matching problems in these counting classes as well. We also show that the search version, computing a perfect matching, for this class of graphs is in FL^SPL. Our results extend the same upper bounds for these problems over bipartite planar graphs known earlier.

As our main technical result, we design a logspace computable and polynomially bounded weight function which isolates a minimum weight perfect matching in bipartite graphs embedded on surfaces of constant genus.  We use results from algebraic topology for proving the correctness of the weight function.

Subject Classification

Keywords
  • perfect matching
  • bounded genus graphs
  • isolation problem

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail