Document Open Access Logo

Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs

Authors Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2016.10.pdf
  • Filesize: 0.66 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • bipartite matching
  • derandomization
  • isolation lemma
  • SPL
  • minor-free graph

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The perfect matching problem has a randomized NC algorithm, using the celebrated Isolation Lemma of Mulmuley, Vazirani and Vazirani. The Isolation Lemma states that giving a random weight assignment to the edges of a graph ensures that it has a unique minimum weight perfect matching, with a good probability. We derandomize this lemma for K3,3-free and K5-free bipartite graphs. That is, we give a deterministic log-space construction of such a weight assignment for these graphs. Such a construction was known previously for planar bipartite graphs. Our result implies that the perfect matching problem for K3,3-free and K5-free bipartite graphs is in SPL. It also gives an alternate proof for an already known result – reachability for K3,3-free and K5-free graphs is in UL.

Cite As Get BibTex

Rahul Arora, Ashu Gupta, Rohit Gurjar, and Raghunath Tewari. Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/LIPIcs.STACS.2016.10

Author Details

Rahul Arora
Ashu Gupta
Rohit Gurjar
Raghunath Tewari

References

  1. Manindra Agrawal, Thanh Minh Hoang, and Thomas Thierauf. The polynomially bounded perfect matching problem is in NC². In Wolfgang Thomas and Pascal Weil, editors, STACS 2007, volume 4393 of Lecture Notes in Computer Science, pages 489-499. Springer Berlin Heidelberg, 2007. Google Scholar
  2. Eric Allender, Klaus Reinhardt, and Shiyu Zhou. Isolation, matching, and counting uniform and nonuniform upper bounds. J. Comput. Syst. Sci., 59(2):164-181, 1999. Google Scholar
  3. Rahul Arora, Ashu Gupta, Rohit Gurjar, and Raghunath Tewari. Derandomizing isolation lemma for K_3,3-free and K_5-free bipartite graphs. Technical Report TR14-161, Electronic Colloquium on Computational Complexity (ECCC), 2014. Google Scholar
  4. V. Arvind and Partha Mukhopadhyay. Derandomizing the isolation lemma and lower bounds for circuit size. In Ashish Goel, Klaus Jansen, JoséD.P. Rolim, and Ronitt Rubinfeld, editors, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, volume 5171 of Lecture Notes in Computer Science, pages 276-289. Springer Berlin Heidelberg, 2008. Google Scholar
  5. Takao Asano. An approach to the subgraph homeomorphism problem. Theoretical Computer Science, 38(0):249 - 267, 1985. Google Scholar
  6. Chris Bourke, Raghunath Tewari, and N. V. Vinodchandran. Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory, 1(1):4:1-4:17, February 2009. Google Scholar
  7. Richard P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21(2):201-206, April 1974. Google Scholar
  8. Bireswar Das, Samir Datta, and Prajakta Nimbhorkar. Log-space algorithms for paths and matchings in k-trees. Theory of Computing Systems, 53(4):669-689, 2013. Google Scholar
  9. Samir Datta, Raghav Kulkarni, and Sambuddha Roy. Deterministically isolating a perfect matching in bipartite planar graphs. Theory of Computing Systems, 47:737-757, 2010. Google Scholar
  10. Samir Datta, Raghav Kulkarni, Raghunath Tewari, and N. V. Vinodchandran. Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci., 78(3):765-779, 2012. Google Scholar
  11. Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner. Graph isomorphism for K_3,3-free and K₅-free graphs is in log-space. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India, pages 145-156, 2009. Google Scholar
  12. Jack Edmonds. Path, trees, and flowers. Canadian J. Math., 17:449–467, 1965. Google Scholar
  13. Stephen A. Fenner, Rohit Gurjar, and Thomas Thierauf. Bipartite perfect matching is in quasi-nc. Technical Report TR15-177, Electronic Colloquium on Computational Complexity (ECCC), 2015. Google Scholar
  14. Dima Grigoriev and Marek Karpinski. The matching problem for bipartite graphs with polynomially bounded permanents is in NC (extended abstract). In 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987, pages 166-172, 1987. Google Scholar
  15. Thanh Minh Hoang. On the matching problem for special graph classes. In IEEE Conference on Computational Complexity, pages 139-150. IEEE Computer Society, 2010. Google Scholar
  16. John E. Hopcroft and Robert Endre Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2(3):135-158, 1973. Google Scholar
  17. Camille Jordan. Sur les assemblages de lignes. Journal für die reine und angewandte Mathematik, 70:185-190, 1869. Google Scholar
  18. Richard M. Karp, Eli Upfal, and Avi Wigderson. Constructing a perfect matching is in random NC. Combinatorica, 6(1):35-48, 1986. Google Scholar
  19. Arpita Korwar. Matching in planar graphs. Master’s thesis, Indian Institute of Technology Kanpur, 2009. Google Scholar
  20. Raghav Kulkarni, Meena Mahajan, and Kasturi R. Varadarajan. Some perfect matchings and perfect half-integral matchings in NC. Chicago Journal of Theoretical Computer Science, 2008(4), September 2008. Google Scholar
  21. Nutan Limaye, Meena Mahajan, and B.V.Raghavendra Rao. Arithmetizing classes around NC₁ and l. In STACS 2007, volume 4393 of Lecture Notes in Computer Science, pages 477-488. Springer Berlin Heidelberg, 2007. Google Scholar
  22. Steven Lindell. A logspace algorithm for tree canonization (extended abstract). In Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing, STOC '92, pages 400-404, New York, NY, USA, 1992. ACM. Google Scholar
  23. László Lovász. On determinants, matchings, and random algorithms. In FCT, pages 565-574, 1979. Google Scholar
  24. Silvio Micali and Vijay V. Vazirani. An O(√VE) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual Symposium on Foundations of Computer Science, SFCS '80, pages 17-27, Washington, DC, USA, 1980. IEEE Computer Society. Google Scholar
  25. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105-113, 1987. Google Scholar
  26. Klaus Reinhardt and Eric Allender. Making nondeterminism unambiguous. SIAM J. Comput., 29(4):1118-1131, 2000. Google Scholar
  27. Neil Robertson and P.D Seymour. Graph minors. xvi. excluding a non-planar graph. Journal of Combinatorial Theory, Series B, 89(1):43 - 76, 2003. Google Scholar
  28. Simon Straub, Thomas Thierauf, and Fabian Wagner. Counting the number of perfect matchings in K₅-free graphs. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pages 66-77, 2014. Google Scholar
  29. Raghunath Tewari and N. V. Vinodchandran. Green’s theorem and isolation in planar graphs. Inf. Comput., 215:1-7, 2012. Google Scholar
  30. Thomas Thierauf and Fabian Wagner. Reachability in K_3,3-free and K₅-free graphs is in unambiguous logspace. Chicago J. Theor. Comput. Sci., 2014, 2014. Google Scholar
  31. Vijay V. Vazirani. NC algorithms for computing the number of perfect matchings in K_3,3-free graphs and related problems. Information and Computing, 80(2):152-164, 1989. Google Scholar
  32. Burchard von Braunmühl and Rutger Verbeek. Input-driven languages are recognized in log n space. In Marek Karpinski, editor, Foundations of Computation Theory, volume 158 of Lecture Notes in Computer Science, pages 40-51. Springer Berlin Heidelberg, 1983. Google Scholar
  33. Klaus Wagner. Über eine Eigenschaft der ebenen Komplexe. Math. Ann., 114, 1937. Google Scholar
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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact