|
Algebra and Discrete Mathematics, 2012, Volume 13, Issue 1, Pages 43–51
(Mi adm64)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
RESEARCH ARTICLE
A linear algorithm of checking of the graph connectness
Irina Dudchenkoa, Makar Plakhotnykb a Sloviansk pedagogical university, Generala Batuka str., 19, 84116, Sloviansk, Ukraine
b Department of Mechanics and Mathematics, Kyiv National Taras Shevchenko Univ., Volodymyrska str., 64, 01033 Kyiv, Ukraine
Abstract:
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.
Received: 02.10.2011 Revised: 24.10.2011
Citation:
Irina Dudchenko, Makar Plakhotnyk, “A linear algorithm of checking of the graph connectness”, Algebra Discrete Math., 13:1 (2012), 43–51
Linking options:
https://www.mathnet.ru/eng/adm64 https://www.mathnet.ru/eng/adm/v13/i1/p43
|
Statistics & downloads: |
Abstract page: | 245 | Full-text PDF : | 116 | References: | 60 | First page: | 1 |
|