A linear algorithm of checking of the graph connectness

dc.contributor.author	Dudchenko, I.
dc.contributor.author	Plakhotnyk, M.
dc.date.accessioned	2019-06-08T09:46:44Z
dc.date.available	2019-06-08T09:46:44Z
dc.date.issued	2012
dc.identifier.citation	A linear algorithm of checking of the graph connectness / I. Dudchenko, M. Plakhotnyk // Algebra and Discrete Mathematics. — 2012. — Vol. 13, № 1. — С. 43–51. — Бібліогр.: 5 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/152185
dc.description.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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	A linear algorithm of checking of the graph connectness	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA