Skip to main content
SpringerLink
Log in

Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. G. Aggarwal, R. Motwani, D. Shah, and A. Zhu: Switch scheduling via randomized edge coloring, FOCS, 2003.

    Book  Google Scholar 

  2. A. A. Benczúr, and D. R. Karger: Approximating s-t minimum cuts in ~O (n2) time, Proceedings of the 28th annual ACM symposium on Theory of computing, 1996.

    Google Scholar 

  3. G. Birkhoff: Tres observaciones sobre el algebra lineal, Univ. Nac. Tucumán Rev. Ser. A 5 (1946), 147–151.

    Google Scholar 

  4. B. Bollobás: Modern graph theory, Springer, 1998.

    Book  MATH  Google Scholar 

  5. R. Cole and J. E. Hopcroft: On edge coloring bipartite graphs. SIAM J. Comput. 11 (1982), 540–546.

    Article  MathSciNet  MATH  Google Scholar 

  6. R. Cole, K. Ost, and S. Schirra: Edge-coloring bipartite multigraphs in O(ElogD) time, Combinatorica 21 (2001), 5–12.

    Article  MathSciNet  MATH  Google Scholar 

  7. H. N. Gabow and O. Kariv:Algorithms for edge coloring bipartite graphs and multigraphs, SIAM J. Comput. 11 (1982), 117–129.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Goel, M. Kapralov, and S. Khanna: Perfect matchings via uniform sampling in regular bipartite graphs, Proceedings of the Nineteenth Annual ACM -SIAM Sym-posium on Discrete Algorithms, 2009.

    Google Scholar 

  9. J. E. Hopcroft and R. M. Karp: An n 5 2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2 (1973), 225–231.

    Article  MathSciNet  MATH  Google Scholar 

  10. D. Karger: Random sampling in cut, flow, and network design problems, Mathe-matics of Operations Research (Preliminary version appeared in the Proceedings of the 26th annual ACM symposium on Theory of computing) 24 (1999), 383–413.

    MathSciNet  MATH  Google Scholar 

  11. D. Karger and M. Levine: Random sampling in residual graphs, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002.

    Google Scholar 

  12. D. R. Karger and C. Stein: A new approach to the minimum cut problem, J. ACM 43 (1996), 601–640.

    MathSciNet  MATH  Google Scholar 

  13. D. Konig: Uber graphen und ihre anwendung auf determinententheorie und mengenlehre, Math. Annalen 77 (1916), 453–465.

    Article  MathSciNet  MATH  Google Scholar 

  14. R. Motwani: Average-case analysis of algorithms for matchings and related problems, Journal of the ACM(JACM) 41 (1994), 1329–1356.

    Article  MathSciNet  MATH  Google Scholar 

  15. R. Motwani and P. Raghavan: Randomized Algorithms, Cambridge University Press, 1995.

    Book  MATH  Google Scholar 

  16. A. Schrijver: Bipartite edge coloring in O time, SIAM J. on Comput. 28 (1999), 841–846.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. von Neumann: A certain zero-sum two-person game equivalent to the optimal assignment problem, Contributions to the optimal assignment problem to the Theory of Games 2 (1953), 5–12.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Management Science and Engineering and (by courtesy) Computer Science, Stanford University, Stanford, USA

    Ashish Goel

  2. School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Écublens, Switzerland

    Michael Kapralov

  3. Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA

    Sanjeev Khanna

Authors
  1. Ashish Goel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kapralov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanjeev Khanna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ashish Goel.

Additional information

Research supported by NSF ITR grant 0428868, NSF CAREER award 0339262, and a grant from the Stanford-KAUST alliance for academic excellence.

Research supported by a Stanford Graduate Fellowship.

Supported in part by a Guggenheim Fellowship, an IBM Faculty Award, and by NSF Award CCF-0635084.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goel, A., Kapralov, M. & Khanna, S. Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs. Combinatorica 39, 323–354 (2019). https://doi.org/10.1007/s00493-015-2653-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-015-2653-6

Mathematics Subject Classification (2010)

Search

Navigation