Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
type: Item
instance of: scholarly article
title: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
zbMATH Open document ID: 0714.68036
DOI: 10.1016/0020-0190(91)90195-N
author: D. Kharzeev
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4176448
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: matching
zbMATH Keywords: bipartite graph
Wikidata QID: Q56626048
MaRDI profile type: Publication
cites work: A Fast and Simple Algorithm for the Maximum Flow Problem
cites work: Q4038695
cites work: A new approach to the maximum-flow problem
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
full work available at URL: 0020-0190(91)90195-n
OpenAlex ID: W1541277988
DBLP publication ID: journals/ipl/AltBMP91
description: scientific article; zbMATH DE number 4176448