An approximation algorithm for the maximum leaf spanning arborescence problem

Multilingual Wikipedia

In June 2020 the work An approximation algorithm for the maximum leaf spanning arborescence problem was on the 686,059th place in the ranking of the most reliable and popular publications with DOI number in multilingual Wikipedia from readers' point of view (PR-score). If we consider only frequency of appearance of this source in references of Wikipedia articles (F-score), this work was on the 787,404th place in June 2020. From Wikipedians' point of view, "An approximation algorithm for the maximum leaf spanning arborescence problem" is the 1,007,976th most reliable publication with DOI number in different language versions of Wikipedia (AR-score).

PR-score:
686,059th place
1,580
-366
AR-score:
1,007,976th place
76
0
F-score:
787,404th place
1
0

English Wikipedia (en)

PR-score:
580,473rd place
1,580
-366
AR-score:
840,138th place
76
0
F-score:
518,139th place
1
0

BestRef shows popularity and reliability scores for sources in references of Wikipedia articles in different languages. Data extraction based on complex method using Wikimedia dumps. To find the most popular and reliable sources we used information about over 200 million references of Wikipedia articles. More details...