DocumentCode
3354636
Title
A new way to enumerate cycles in graph
Author
Liu, Hongbo ; Wang, Jiaxin
Author_Institution
Tsinghua University, China
fYear
2006
fDate
19-25 Feb. 2006
Firstpage
57
Lastpage
57
Abstract
In many cases, the topology of communcation systems can be abstracted and represented as graph. Graph theories and algorithms are useful in these situations. In this paper, we introduced an algorithm to enumerate all cycles in a graph. It can be applied on digraph or undirected graph. Multigraph can also be used on for this purpose. It can be used to enumerate given length cycles without enumerating all cycles. This algorithm is simple and easy to be implemented.
Keywords
Communication systems; Computer science; Fault tolerant systems; Graph theory; Intelligent systems; Search methods; Telecommunication network reliability; Topology; Tree graphs; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference on
Print_ISBN
0-7695-2522-9
Type
conf
DOI
10.1109/AICT-ICIW.2006.22
Filename
1602189
Link To Document