Revision as of 17:34, 24 September 2021 edit User-duck (talk \| contribs) Extended confirmed users 37,052 edits SFN all sources to eliminate duplicate cite. ← Previous edit		Revision as of 06:31, 14 November 2021 edit undo Citation bot (talk \| contribs) Bots 5,864,827 edits Add: s2cid. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_toolbar Next edit →
Line 144: \| title = Matching algorithms are fast in sparse random graphs \| volume = 39 \| year = 2006}}\| s2cid = 9321036 }} {{citation\|first1=S. Frank\|last1=Chang\|first2=S. Thomas\|last2=McCormick\|title=A faster implementation of a bipartite cardinality matching algorithm\|publisher=Tech. Rep. 90-MSC-005, Faculty of Commerce and Business Administration, Univ. of British Columbia\|year=1990}}. As cited by {{harvtxt\|Setubal\|1996}}. {{citation\|first=Kenneth\|last=Darby-Dowman\|title=The exploitation of sparsity in large scale linear programming problems – Data structures and restructuring algorithms\|publisher=Ph.D. thesis, Brunel University \|year=1980}}. As cited by {{harvtxt\|Setubal\|1996}}.

Hopcroft–Karp algorithm: Difference between revisions