NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems

Multilingual Wikipedia

In June 2020 the work NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems was on the 686,596th 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 393,040th place in June 2020. From Wikipedians' point of view, "NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems" is the 541,589th most reliable publication with DOI number in different language versions of Wikipedia (AR-score).

PR-score:
686,596th place
1,575
-350
AR-score:
541,589th place
406
0
F-score:
393,040th place
3
0

English Wikipedia (en)

PR-score:
635,546th place
1,142
-586
AR-score:
652,304th place
185
0
F-score:
781,283rd place
1
0

Russian Wikipedia (ru)

PR-score:
48,170th place
318
+164
AR-score:
41,843rd place
63
0
F-score:
61,960th place
1
0

Persian Wikipedia (fa)

PR-score:
14,006th place
114
+72
AR-score:
5,059th place
157
0
F-score:
10,186th 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...