A linear algorithm of checking of the graph connectness
Algebra and discrete mathematics, Tome 13 (2012) no. 1, pp. 43-51
Cet article a éte moissonné depuis 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},
year = {2012},
volume = {13},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/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/
[1] F. R. Gantmaher, Matrices theory, Nauka, M., 1966, 576 pp. (in russian) | MR
[2] I. V. Dudchenko, Strongly connected quivers, their indices and eigenvalues, Preprint of NASU mathematical inst., Kyiv, 2007, 28 pp. (in russian) | Zbl
[3] I. V. Dudchenko, “Fujiita Algebras properties”, Sci. Bull. of National Dragomanov Univ. Ser: Phys.-Math., 2005, no. 6, 126–130 (in ukrainian)
[4] I. V. Dudchenko, “Fujiita Algebras”, Bull. of Taras Shevchenko National University of Kyiv. Ser: Phys.-Math., 2011, no. 2–3 (to appear) (in ukrainian)
[5] F. Harari, Graph theory, M., 1973 (in russian) | Zbl