A linear algorithm of checking of the graph connectness
An algorithm of sorting of all simply laced graph such that subalgorithm of checking of that the graph is connected is of linear dependence on the number of vertices of the graph.
Збережено в:
| Опубліковано в: | Algebra and Discrete Mathematics |
|---|---|
| Дата: | 2012 |
| ISSN: | 1726-3255 |
| Автори: | , |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2012
|
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/152185 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | A linear algorithm of checking of the graph connectness / I. Dudchenko, M. Plakhotnyk // Algebra and Discrete Mathematics. — 2012. — Vol. 13, № 1. — С. 43–51. — Бібліогр.: 5 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862557677940375552 |
|---|---|
| author | Dudchenko, I. Plakhotnyk, M. |
| author_facet | Dudchenko, I. Plakhotnyk, M. |
| citation_txt | A linear algorithm of checking of the graph connectness / I. Dudchenko, M. Plakhotnyk // Algebra and Discrete Mathematics. — 2012. — Vol. 13, № 1. — С. 43–51. — Бібліогр.: 5 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | An algorithm of sorting of all simply laced graph such that subalgorithm of checking of that the graph is connected is of linear dependence on the number of vertices of the graph.
|
| first_indexed | 2025-11-25T22:45:08Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-152185 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-11-25T22:45:08Z |
| publishDate | 2012 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Dudchenko, I. Plakhotnyk, M. 2019-06-08T09:46:44Z 2019-06-08T09:46:44Z 2012 A linear algorithm of checking of the graph connectness / I. Dudchenko, M. Plakhotnyk // Algebra and Discrete Mathematics. — 2012. — Vol. 13, № 1. — С. 43–51. — Бібліогр.: 5 назв. — англ. 1726-3255 https://nasplib.isofts.kiev.ua/handle/123456789/152185 An algorithm of sorting of all simply laced graph such that subalgorithm of checking of that the graph is connected is of linear dependence on the number of vertices of the graph. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics A linear algorithm of checking of the graph connectness Article published earlier |
| spellingShingle | A linear algorithm of checking of the graph connectness Dudchenko, I. Plakhotnyk, M. |
| title | A linear algorithm of checking of the graph connectness |
| title_full | A linear algorithm of checking of the graph connectness |
| title_fullStr | A linear algorithm of checking of the graph connectness |
| title_full_unstemmed | A linear algorithm of checking of the graph connectness |
| title_short | A linear algorithm of checking of the graph connectness |
| title_sort | linear algorithm of checking of the graph connectness |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/152185 |
| work_keys_str_mv | AT dudchenkoi alinearalgorithmofcheckingofthegraphconnectness AT plakhotnykm alinearalgorithmofcheckingofthegraphconnectness AT dudchenkoi linearalgorithmofcheckingofthegraphconnectness AT plakhotnykm linearalgorithmofcheckingofthegraphconnectness |