Geodesic
A linear algorithm of checking of the graph connectness
Algebra and discrete mathematics, Tome 13 (2012) no. 1, pp. 43-51

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{ADM_2012_13_1_a4,
     author = {Irina Dudchenko and Makar Plakhotnyk},
     title = {A linear algorithm of checking of the graph connectness},
     journal = {Algebra and discrete mathematics},
     pages = {43--51},
     publisher = {mathdoc},
     volume = {13},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ADM_2012_13_1_a4/}
}
TY  - JOUR
AU  - Irina Dudchenko
AU  - Makar Plakhotnyk
TI  - A linear algorithm of checking of the graph connectness
JO  - Algebra and discrete mathematics
PY  - 2012
SP  - 43
EP  - 51
VL  - 13
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ADM_2012_13_1_a4/
LA  - en
ID  - ADM_2012_13_1_a4
ER  - 
%0 Journal Article
%A Irina Dudchenko
%A Makar Plakhotnyk
%T A linear algorithm of checking of the graph connectness
%J Algebra and discrete mathematics
%D 2012
%P 43-51
%V 13
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ADM_2012_13_1_a4/
%G en
%F ADM_2012_13_1_a4
Irina Dudchenko; Makar Plakhotnyk. A linear algorithm of checking of the graph connectness. Algebra and discrete mathematics, Tome 13 (2012) no. 1, pp. 43-51. http://geodesic.mathdoc.fr/item/ADM_2012_13_1_a4/