Fundamental cycles generation based on dynamic constructing of graph trees
Łukasz Golly, Andrzej Pułka · ICSES 2010 International Conference on Signals and Electronic Circuits · 2010
The paper introduces the original algorithm of finding minimal fundamental cycles in the undirected graph. The presented approach uses a specific graph representation of the triangular neighborhood matrix for finding minimal cycles. Then the algorithm generates the graph tree by adding these cycles. The methodology is described step by step on examples and compared to other approaches in the field. Finally, the results of some tests and conclusions emphasizing the advantages of the algorithm summarize the work.