An asymptotically optimal algorithm for the minimum weight spanning tree with arbitrarily bounded diameter on random inputs - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

An asymptotically optimal algorithm for the minimum weight spanning tree with arbitrarily bounded diameter on random inputs Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Url доклада

Конференция

The 12th International Conference on Analysis of Images, Social Networks and Texts,
17-19 окт. 2024 , Bishkek, Djal, Kyrgyz-Turkish Manas University

Авторы

Gimadi E.Kh. ¹ , Tsidulko O.Yu. ¹

Организации

1	Институт математики им. С.Л. Соболева СО РАН

Gimadi E.K. , Tsidulko O.Y.
An asymptotically optimal algorithm for the minimum weight spanning tree with arbitrarily bounded diameter on random inputs
The 12th International Conference on Analysis of Images, Social Networks and Texts, 17-19 Oct 2024