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.

Gespeichert in:
Bibliographische Detailangaben
Datum:2018
Hauptverfasser: Dudchenko, Irina, Plakhotnyk, Makar
Format: Artikel
Sprache:English
Veröffentlicht: Lugansk National Taras Shevchenko University 2018
Schlagworte:
Online Zugang:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/691
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Algebra and Discrete Mathematics

Institution

Algebra and Discrete Mathematics