DocumentCode :
528653
Title :
Fundamental cycles generation based on dynamic constructing of graph trees
Author :
Golly, Lukasz ; Pulka, Andrzej
Author_Institution :
Inst. of Electron., Silesian Univ. of Technol., Gliwice, Poland
fYear :
2010
fDate :
7-10 Sept. 2010
Firstpage :
197
Lastpage :
200
Abstract :
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.
Keywords :
matrix algebra; trees (mathematics); fundamental cycles generation; graph representation; graph trees dynamic construction; triangular neighborhood matrix; undirected graph; Algorithm design and analysis; Benchmark testing; Computer aided software engineering; Heuristic algorithms; Indexes; Web sites;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals and Electronic Systems (ICSES), 2010 International Conference on
Conference_Location :
Gliwice
Print_ISBN :
978-1-4244-5307-8
Electronic_ISBN :
978-83-9047-4-2
Type :
conf
Filename :
5595217
Link To Document :
بازگشت