Дополнение графа до сильно связного (Russian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Дополнение графа до сильно связного" in Russian language version.

refsWebsite

Global rank Russian rank

2^nd place

3^rd place

low place

451^st place

2,245^th place

ams.org

Эсваран, Капали П.; Тарьян, Р. Андре (1976), "Augmentation problems", en:SIAM Journal on Computing, 5 (4): 653–665, doi:10.1137/0205044, MR 0449011
Frederickson, Greg N.; Ja'Ja', Joseph (1981), "Approximation algorithms for several graph augmentation problems", en:SIAM Journal on Computing, 10 (2): 270–283, doi:10.1137/0210019, MR 0615218

Эсваран, Капали П.; Тарьян, Р. Андре (1976), "Augmentation problems", en:SIAM Journal on Computing, 5 (4): 653–665, doi:10.1137/0205044, MR 0449011
Frederickson, Greg N.; Ja'Ja', Joseph (1981), "Approximation algorithms for several graph augmentation problems", en:SIAM Journal on Computing, 10 (2): 270–283, doi:10.1137/0210019, MR 0615218
Klinkby, Kristine Vitting; Misra, Pranabendu; Saurabh, Saket (January 2021), "Strong connectivity augmentation is FPT", Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, pp. 219–234, doi:10.1137/1.9781611976465.15
Raghavan, S. (2005), "A note on Eswaran and Tarjan's algorithm for the strong connectivity augmentation problem", in Golden, Bruce; Raghavan, S.; Wasil, Edward (eds.), The Next Wave in Computing, Optimization, and Decision Technologies, Operations Research/Computer Science Interfaces Series, vol. 29, Springer, pp. 19–26, doi:10.1007/0-387-23529-9_2

Эсваран, Капали П.; Тарьян, Р. Андре (1976), "Augmentation problems", en:SIAM Journal on Computing, 5 (4): 653–665, doi:10.1137/0205044, MR 0449011
Frederickson, Greg N.; Ja'Ja', Joseph (1981), "Approximation algorithms for several graph augmentation problems", en:SIAM Journal on Computing, 10 (2): 270–283, doi:10.1137/0210019, MR 0615218