Romanian Arbore minim de acoperire Cited by user Andrei Stroe on 15 Oct 2021 dreapta|miniatura|300x300px| Un [[graf planar și arborele său minim de acoperire. Fiecare muchie este etichetată cu ponderea sa, care aici este aproximativ proporțională…
Russian Алгоритм Эдмондса Cited by user Jumpow on 11 Mar 2019 Алгоритм Эдмондса или алгоритм Чу — Лью/Эдмондса — это алгоритм поиска остовного минимального веса для заданного корня (иногда называемого оптимальным ветвлением).
French Algorithme de Chu-Liu/Edmonds Cited by user Scarcetissue on 10 Oct 2018 En théorie des graphes, l'algorithme d'Edmonds ou algorithme de Chu-Liu/Edmonds est un algorithme fournissant une arborescence couvrante de poids minimal dans un graphe.
Spanish Algoritmo de Edmond Cited by user Inajarrop on 27 Feb 2017 En teoría de grafos, el Algoritmo de Edmond es un algoritmo para encontrar una arborescencia de peso mínimo (a veces llamado de óptima derivación).
English Minimum spanning tree Cited by user Erel Segal on 26 Nov 2014 Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together.
English Zvi Galil Cited by user Justin W Smith on 27 Jun 2011 Zvi Galil (צבי גליל; born June 26, 1947) is an Israeli-American computer scientist and mathematician.