BibTeX record journals/ipl/AltBMP91

download as .bib file

@article{DBLP:journals/ipl/AltBMP91,
  author       = {Helmut Alt and
                  Norbert Blum and
                  Kurt Mehlhorn and
                  Markus Paul},
  title        = {Computing a Maximum Cardinality Matching in a Bipartite Graph in Time
                  O({\^{}}1.5 sqrt m/log n)},
  journal      = {Inf. Process. Lett.},
  volume       = {37},
  number       = {4},
  pages        = {237--240},
  year         = {1991},
  url          = {https://doi.org/10.1016/0020-0190(91)90195-N},
  doi          = {10.1016/0020-0190(91)90195-N},
  timestamp    = {Wed, 14 Nov 2018 10:49:25 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/AltBMP91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.