Solving unweighted and weighted bipartite matching problems in theory and practice

Authors:
Robert J. Kennedy, Jr.
Affiliations:
Stanford Univ.
Venue:
Solving unweighted and weighted bipartite matching problems in theory and practice
Year:
1996

Citing 0
Cited 2

Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms

Journal of Experimental Algorithmics (JEA)
Push-relabel based algorithms for the maximum transversal problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract