A new way to enumerate cycles in graph

Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT/ICIW'06

Volumn 2006, Issue , 2006, Pages 57-

  Liu, Hongbo ^a   Wang, Jiaxin ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; TOPOLOGY;

MULTIGRAPH; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 33749078933     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AICT-ICIW.2006.22     Document Type: Conference Paper

References (8)

1. R. W. Floyd. Nondeterministic algorithms. J. Assoc. Comput. Mach, 4:636-644, 1967.
2. D. B. Johnson. Find all the elementary circuits of a directed graph. J. SIAM, 4:77-84, 1975.
3. P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Comput., 5:90-99, 1976.
4. M. Médard and S. S. Lumetta. Network reliability and fault tolerance. In J. Proakis, editor, Wiley Encyclopedia of Engineering.
5. V. V. B. Rao and V. G. K. Muti. Enumeration of all circuits of a graph. Proc. IEEE, 57:700-701, 1969.
6. H. D. Rozenfeld et al. Statistics of cycles: how loopy is your network? J. Phys. A: Math. Gen., 38:4589-4595, 2005.
7. R. Tarjan. Enumeration of the elementary circuits of a directed graph. J. SIAM, 2:211-216, 1973.
8. J. C. Tiernan. An efficient search algorithm to find the elementary circuits of a graph. Comm. ACM, 13:722-726, 1970.