Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Fudan University》 2001-03
Add to Favorite Get Latest Update

Isomorphism Testing Algorithm for Graphs:Incidence Degree Sequence Method and Applications

LI Feng 1, LI Xiao yan 2 (1.Department of Electronic Engineering,Fudan University,Shanghai 200433,China; 2.Department of Management Science,Fudan University,Shanghai 200433,China)  
A new isomorphism testing algorithm for graphs is presented,which consists of incidence degree sequence method and improved golden section incidence degree sequence method.The computational complexity of the improved algorithm approaches polynomial complexity,much less than 2 N ( N is the vertex number of a graph).The algorithm can be used in many pattern recognition problems which can be described by graphs.
【Fund】: 国家自然科学基金资助项目 (6 9372 0 37)
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved