Keyword

augmenting paths

Description: Augmenting paths are paths in a graph that alternate between unmatched and matched edges, allowing a matching to be enlarged.
Wikidata ID: wiki/Q130378137
OpenAlex ID: keywords/augmenting-paths
2004 · Y. Boykov, V. Kolmogorov · IEEE Transactions on Pattern Analysis and Machine Intelligence · 4,637
1988 · Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1,952
1980 · Silvio Micali, Vijay V. Vazirani · Annual Symposium on Foundations of Computer Science · 896
1986 · A V Goldberg, R E Tarjan · ACM Symposium on Theory of Computing (STOC) · 339
2001 · Yuri Boykov, Vladimir Kolmogorov · Lecture notes in computer science · 327
1986 · Roy Jonker, Ton Volgenant · Operations Research Letters · 282
1985 · Harold N. Garbow · Journal of Computer and System Sciences · 202
1989 · Andrew V. Goldberg, Eva Tardos, et al. · Defense Technical Information Center (DTIC) · 186
2003 · Oliver Giel, Ingo Wegener · Lecture notes in computer science · 183
2016 · Aleksander Madry · Annual Symposium on Foundations of Computer Science · 125
1986 · William H. Cunningham · SIAM Journal on Computing · 117
1982 · E. L. Lawler, C. U. Martel · Mathematics of Operations Research · 113
1985 · Harold N. Gabow · Annual Symposium on Foundations of Computer Science · 111
1987 · Silvano Martello, Paolo Toth · North-Holland mathematics studies · 109
2009 · Qinglin Roger Yu, Guizhen Liu · Springer eBooks · 102
2011 · Iain S. Duff, Kamer Kaya, et al. · ACM Transactions on Mathematical Software · 75
2005 · Norbert Blum · Springer eBooks · 75
1983 · Michael O. Ball, Ulrich Derigs · Networks · 74
2009 · Jonah Sherman · Annual Symposium on Foundations of Computer Science · 69
1998 · David R. Karger, Matthew S. Levine · ACM Symposium on Theory of Computing (STOC) · 65
2016 · Tamás Lukovszki, Matthias Rost, et al. · ACM SIGCOMM Computer Communication Review · 64
1985 · William H. Cunningham, András Frank · Mathematics of Operations Research · 64
Works count: 423
Citation count: 13,070
Year
Topic
Type