%0 Journal Article %1 journals/ipl/AltBMP91 %A Alt, Helmut %A Blum, Norbert %A Mehlhorn, Kurt %A Paul, Markus %D 1991 %J Inf. Process. Lett. %K %N 4 %P 237-240 %T Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). %U http://dblp.uni-trier.de/db/journals/ipl/ipl37.html#AltBMP91 %V 37

@article{journals/ipl/AltBMP91, added-at = {2023-12-14T14:26:03.000+0100}, author = {Alt, Helmut and Blum, Norbert and Mehlhorn, Kurt and Paul, Markus}, biburl = {https://www.bibsonomy.org/bibtex/2fbf579ff3b11c87a84d4b8defd28bb5e/admin}, ee = {https://www.wikidata.org/entity/Q56626048}, interhash = {df9c15827c2b0cd063b0ea8f7df7c549}, intrahash = {fbf579ff3b11c87a84d4b8defd28bb5e}, journal = {Inf. Process. Lett.}, keywords = {}, number = 4, pages = {237-240}, timestamp = {2023-12-14T14:26:03.000+0100}, title = {Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl37.html#AltBMP91}, volume = 37, year = 1991 }