Content deleted Content added
Thatsme314 (talk | contribs) m hyphen (x2) |
m Open access bot: doi added to citation with #oabot. |
||
Line 152:
*{{citation |doi=10.4153/CJM-1965-045-4 |last=Edmonds |first=Jack |author-link=Jack Edmonds |journal=Canadian Journal of Mathematics |pages=449–467 |title=Paths, Trees and Flowers |volume=17 |year=1965 |mr=0177907|s2cid=18909734 }}.
*{{citation|last=Gabow|first=Harold N.|author-link=Harold N. Gabow|doi=10.3233/FI-2017-1555|issue=1–4|journal=Fundamenta Informaticae|mr=3690573|pages=109–130|title=The weighted matching approach to maximum cardinality matching|volume=154|year=2017|arxiv=1703.03998|s2cid=386509}}
*{{citation|first1=Harold N.|last1=Gabow|author1-link=Harold N. Gabow|first2=Robert E.|last2=Tarjan|author2-link=Robert Tarjan|title=Faster scaling algorithms for general graph matching problems|journal=Journal of the ACM|volume=38|issue=4|year=1991|pages=815–853|doi=10.1145/115234.115366|s2cid=18350108|doi-access=free}}.
*{{citation|first1=John E.|last1=Hopcroft|author1-link=John Hopcroft|first2=Richard M.|last2=Karp|author2-link=Richard Karp|title=An ''n''<sup>5/2</sup> algorithm for maximum matchings in bipartite graphs|journal=SIAM Journal on Computing|volume=2|issue=4|pages=225–231|year=1973|doi=10.1137/0202019}}. Previously announced at the 12th Annual Symposium on Switching and Automata Theory, 1971.
*{{citation|first=A. V.|last=Karzanov|authorlink=Alexander V. Karzanov|title=An exact estimate of an algorithm for finding a maximum flow, applied to the problem on representatives|journal=Problems in Cybernetics |volume=5 |pages=66–70|year=1973}}. Previously announced at the Seminar on Combinatorial Mathematics (Moscow, 1971).
*{{citation |last1=Micali |first1=S. |author1-link=Silvio Micali |last2=Vazirani |first2=V. V. |author2-link=Vijay Vazirani |contribution=An <math>\scriptstyle O(\sqrt{|V|}\cdot|E|)</math> algorithm for finding maximum matching in general graphs |doi=10.1109/SFCS.1980.12 |pages=17–27 |title=Proc. 21st IEEE Symp. Foundations of Computer Science |year=1980| title-link=Symposium on Foundations of Computer Science |s2cid=27467816}}.
*{{citation |last1=Peterson |first1=Paul A. |last2=Loui |first2=Michael C. |title=The general maximum matching algorithm of Micali and Vazirani |doi=10.1007/BF01762129 |pages=511–533 |journal=[[Algorithmica]] |date=November 1988 |volume=3|issue=1–4| citeseerx=10.1.1.228.9625 |s2cid=16820 |issn=1432-0541}}.
*{{citation|first=Rajeev|last=Motwani|authorlink=Rajeev Motwani|title=Average-case analysis of algorithms for matchings and related problems|year=1994|journal=Journal of the ACM|volume=41|issue=6|pages=1329–1356|doi=10.1145/195613.195663|s2cid=2968208|doi-access=free}}.
*{{citation|last=Setubal|first=João C.|contribution=New experimental results for bipartite matching |title=Proc. Netflow93|publisher=Dept. of Informatics, Univ. of Pisa|pages=211–216|year=1993}}. As cited by {{harvtxt|Setubal|1996}}.
*{{citation|last=Setubal|first=João C.|title=Sequential and parallel experimental results with bipartite matching algorithms|publisher=Tech. Rep. IC-96-09, Inst. of Computing, Univ. of Campinas|year=1996 |citeseerx=10.1.1.48.3539}}.
| |||