A new way to enumerate cycles in graph Export

@inproceedings{citeulike:1425058, 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.}, author = {Liu, Hongbo and Wang, Jiaxin}, citeulike-article-id = {1425058}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/AICT-ICIW.2006.22}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1602189}, doi = {10.1109/AICT-ICIW.2006.22}, journal = {Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference on}, keywords = {print, search}, pages = {57}, posted-at = {2007-06-30 15:53:36}, priority = {5}, title = {A new way to enumerate cycles in graph}, url = {http://dx.doi.org/10.1109/AICT-ICIW.2006.22}, year = {2006} }

TY - CONF ID - citeulike:1425058 L3 - citeulike-article-id:1425058 N2 - 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. JF - Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference on EP - 57 TI - A new way to enumerate cycles in graph SP - 57 KW - print KW - search AU - Liu, Hongbo AU - Wang, Jiaxin PY - 2006/// UR - http://dx.doi.org/10.1109/AICT-ICIW.2006.22 ER -