A new way to enumerate cycles in graph

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hongbo Liu Articles by Jiaxin Wang

Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW'06)

Guadeloupe, French Caribbean

February 19-February 25

ISBN: 0-7695-2522-9

	ASCII Text	x
	Hongbo Liu, Jiaxin Wang, "A new way to enumerate cycles in graph," Advanced International Conference on Telecommunications / Internet and Web Applications and Services, International Conference on, pp. 57, Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW'06), 2006.

	BibTex	x
	@article{ 10.1109/AICT-ICIW.2006.22, author = {Hongbo Liu and Jiaxin Wang}, title = {A new way to enumerate cycles in graph}, journal ={Advanced International Conference on Telecommunications / Internet and Web Applications and Services, International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2522-9}, pages = {57}, doi = {http://doi.ieeecomputersociety.org/10.1109/AICT-ICIW.2006.22}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Advanced International Conference on Telecommunications / Internet and Web Applications and Services, International Conference on TI - A new way to enumerate cycles in graph SN - 0-7695-2522-9 SP EP A1 - Hongbo Liu, A1 - Jiaxin Wang, PY - 2006 KW - null VL - 0 JA - Advanced International Conference on Telecommunications / Internet and Web Applications and Services, International Conference on ER -

Hongbo Liu, Tsinghua University, China

Jiaxin Wang, Tsinghua University, China

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AICT-ICIW.2006.22

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.

Citation:

Hongbo Liu, Jiaxin Wang, "A new way to enumerate cycles in graph," aict-iciw, pp.57, Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.