RUS  ENG
Full version
JOURNALS // Algebra and Discrete Mathematics // Archive

Algebra Discrete Math., 2012 Volume 13, Issue 1, Pages 43–51 (Mi adm64)

This article is cited 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

Language: English



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026