A linear algorithm of checking of the graph connectness
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.
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2012 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2012
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/152185 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | A linear algorithm of checking of the graph connectness / I. Dudchenko, M. Plakhotnyk // Algebra and Discrete Mathematics. — 2012. — Vol. 13, № 1. — С. 43–51. — Бібліогр.: 5 назв. — англ. |