Štefan Berežný, Ján Buša, Michal Staš

Software Solution of the Algorithm of the Cyclic-Order Graph

Číslo: 1/2018
Periodikum: Acta Electrotechnica et Informatica
DOI: 10.15546/aeei-2018-0001

Klíčová slova: crossing number, cyclic permutations, algorithm, graph, distances in graph

Pro získání musíte mít účet v Citace PRO.

Anotace: In this paper we describe by pseudo-code the “Algorithm of the cyclic-order graph”, which we programmed in MATLAB 2016a and which is also possible to be executed in GNU Octave. We describe program’s functionality and its use. The program implementing this algorithm is an indispensable tool during proofs in the field of graph theory, especially when dealing with crossing numbers for join products of graphs with paths of given numbers of vertices.