Keyword

blossom algorithm

Description: A graph algorithm that finds maximum matchings by contracting odd cycles, or blossoms, during the search for augmenting paths.
Wikidata ID: wiki/Q1030529
OpenAlex ID: keywords/blossom-algorithm
1973 · Jack Edmonds, Ellis L. Johnson · Mathematical Programming · 1,206
1980 · Silvio Micali, Vijay V. Vazirani · Annual Symposium on Foundations of Computer Science · 1,164
2012 · J.‐F. Remacle, J. Lambrechts, et al. · International Journal for Numerical Methods in Engineering · 208
1978 · W. H. Cunningham, A. B. Marsh · Mathematical programming studies · 192
2013 · J.‐F. Remacle, F. Henrotte, et al. · International Journal for Numerical Methods in Engineering · 83
1983 · Michael O. Ball, Ulrich Derigs · Networks · 81
2023 · Suhas Vittal, Poulami Das, et al. · Proceedings - International Symposium on Computer Architecture/Proceedings · 78
2023 · Christopher Chamberland, Luis Goncalves, et al. · Quantum Science and Technology · 73
2018 · Harold N. Gabow · ACM Transactions on Algorithms · 69
1989 · André Bouchet · Discrete Applied Mathematics · 66
2020 · Savvas Varsamopoulos, Koen Bertels, et al. · Quantum Machine Intelligence · 58
2018 · Payam Ghassemi, Souma Chowdhury · ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE) · 50
2022 · Wu, Yue, Liyanage, Namitha, et al. · arXiv (Cornell University) · 40
2008 · James B. Orlin · Springer eBooks · 39
2017 · Abdulkadir Celik, Redha M. Radaydeh, et al. · IEEE Globecom Workshops (GC Wkshps) · 34
1982 · Katta G. Murty, Clovis Perin · Networks · 29
2011 · J. -F. Remacle, F. Henrotte, et al. · Springer eBooks · 24
2017 · Chang Liu, Paul L. Rosin, et al. · IEEE Transactions on Image Processing · 23
2021 · Manoj Gupta, Shahbaz Khan · Society for Industrial and Applied Mathematics eBooks · 18
1999 · M. Müller-Hannemann, A. Schwartz · ACM Journal of Experimental Algorithmics · 18
2018 · Alexandr Kazda, Vladimir Kolmogorov, et al. · ACM Transactions on Algorithms · 16
Works count: 94
Citation count: 3,608
Year
Topic
Type