DocumentCode
3202971
Title
A time and memory efficient way to enumerate cycles in a graph
Author
Sankar, K. ; Sarad, A.V.
Author_Institution
AU-KBC Res. Centre, ALT Campus of Anna Univ., Chennai
fYear
2007
fDate
25-28 Nov. 2007
Firstpage
498
Lastpage
500
Abstract
Enumerating the cycles in a graph finds numerous applications in communication systems. It is also possible to find given length cycles without enumerating all cycles in the graph. We enumerate the cycles in a directed and undirected graph, in a time and memory efficient manner and make the operations parallelizable, maintaining ease and simplicity to implement.
Keywords
computational complexity; directed graphs; parallel algorithms; communication system; computational complexity; directed graph; graph cycle enumeration; parallel algorithm; undirected graph; Books; Communication networks; Communication systems; Graph theory; Intelligent systems; Memory management; Optimization methods; Random access memory; Tail; Time factors; Computational Methods; Graph Theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent and Advanced Systems, 2007. ICIAS 2007. International Conference on
Conference_Location
Kuala Lumpur
Print_ISBN
978-1-4244-1355-3
Electronic_ISBN
978-1-4244-1356-0
Type
conf
DOI
10.1109/ICIAS.2007.4658438
Filename
4658438
Link To Document