A perfect matching algorithm for sparse bipartite graphs

DOI10.1016/0166-218X(84)90026-XzbMath0554.05053OpenAlexW2078902693MaRDI QIDQ759771

Eugeniusz Toczyłowski

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90026-x

zbMATH Keywords

algorithmsperfect matchingblock triangularization of matrices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• Depth-First Search and Linear Graph Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: A perfect matching algorithm for sparse bipartite graphs