Keyword

Edmonds' algorithm

Description: Edmonds' algorithm is a graph-theoretic method for finding an optimum branching, or directed spanning tree, in a directed graph.
Wikidata ID: wiki/Q1752324
OpenAlex ID: keywords/edmonds-algorithm
1980 · L Bieche, J P Uhry, et al. · Journal of Physics A Mathematical and General · 193
1982 · F Barahona, R Maynard, et al. · Journal of Physics A Mathematical and General · 184
2008 · Vadim V. Lozin, Martin Milanič · Journal of Discrete Algorithms · 138
2002 · K.R. Varadarajan · Annual Symposium on Foundations of Computer Science · 88
2004 · P. Kopylov, P. Franti · IEEE Transactions on Image Processing · 48
2003 · Leonidas Georgiadis · Theoretical Computer Science · 46
1993 · Matteo Fischetti, Paolo Toth · INFORMS journal on computing · 42
2017 · Harold N. Gabow · Fundamenta Informaticae · 40
1981 · G. M. Weber · Networks · 36
2016 · Lei Hu, Richard Zanibbi · International Conference on Frontiers in Handwriting Recognition · 35
2019 · Mahshad Mahdavi, Michael Condon, et al. · IAPR International Conference on Document Analysis and Recognition (ICDAR) · 26
2005 · Kamalika Chaudhuri, Satish Rao, et al. · Lecture notes in computer science · 26
2011 · Swaminathan Sankararaman, Alon Efrat, et al. · Ad Hoc Networks · 22
2015 · Cassio P. de Campos, Giorgio Corani, et al. · International Journal of Approximate Reasoning · 21
2001 · Kurt Mehlhorn, Guido Schäfer · Lecture notes in computer science · 21
2006 · Vadim V. Lozin, Martin Milanič · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 19
1970 · Ugo Montanari · Artificial Intelligence · 19
1984 · J.C. Angles d'Auriac, R. Maynard · Solid State Communications · 17
1973 · Donald E. Knuth · 17
2014 · Cassio P. de Campos, Marco Cuccu, et al. · Lecture notes in computer science · 14
Works count: 108
Citation count: 1,612
Year
Topic
Type