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

A Supplement of the Complexity of Graph Isomorphism Test

Luo Shifeng (Coll.of Comp.& Info.Engi.,Guangxi Univ.,Nanning,Guangxi,530004,China)  
The vertex with maximum degree and its incidence edges in the graph G are deleted The remaning subgraphs follow in the same way until the last subgraph empty If degrees of the deleted vertexes x\-1,x\-2,…,x\-l are P\-1,P\-2,…,P\-l in order The series P\-1,P\-2,…,P\-l is called the degree series of the graph G The set consists of the degrees of other ends of the incidance edges of x\-i(1≤i≤l) in graph G,is called the incidence degree set of x\-i The complexity of graph isomorphism test is proved to be polynomial by calculating and comparing the degree series,the degrees of the deleted vertexes and their incidence degree set
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 2 Hits
1 WEN Jian-wei,ZHONG Rui (College of Information Management,Chengdu University of Technology,Chengdu Sichuan 610059,China);A New Method for Determining the Isomorphism between Two Graphs[J];Journal of Hebei Polytechnic University(Natural Science Edition);2008-01
2 DAI Qiong~1 ZOU Xiao-Xiang~2 TAN Jian-Long~3(Institute of Software, Chinese Academy of Sciences, Beijing 100080)~1(National Computer Network & Information Security Administration Center, Beijing 100029)~2(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080)~3;Analysis on Complexity of Graph Isomorphism Problem[J];Computer Science;2006-11
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 Wang ZhirenDepartment of Mathematics and Physics Liu YufengDepartment of Computer and Information Engineering;The Simulative Annealing Algorithm for the Problem of the Maximum Independent Set of Graph[J];;1997-03
2 Zhuo Zhongchang; Liu Yufeng(Dept.of Computer);Research for The Maximum Independent Set Problem of Graph Based on The Principle of Neural Network[J];;1995-04
3 Guo Honggui et al (Navigation Department);Microcomputer Algorithm of Astronomical Fixing and Compass Errors[J];Journal of Dalian Maritime University;1984-04
4 Gu Wei Wu Xunwei ( University of Hangzhou );The Design and Research of the Bipolar Practical Circuit for the Optimal ULG_2[J];Research & Progress of Solid State Electronics;1982-03
5 He Ling Wu Xunwei;Fault Detection in Combinatorial Networks of Universal-Logic-Gates[J];JOURNAL OF HANGZHOU UNIVERSITY(NATURE SCIENCE);1985-04
6 XU YA-PING;CHEN KAI-ZHOU Department of Mathematics, Hanzhong Teachers College, Hanzhong 723001, PRC Xi'an University of Electronic Science and Technology, Xi'an 710071, PRC;THE NECESSARY AND SUFFICIENT CONDITION OF H-GRAPH AND THE OPTIMIZING MODELS OF MINIMUM H-CIRCUIT[J];中国科学A辑(英文版);1992-05
7 Hou Luoming;FATAS——An Automated Analysis System for FORTRAN Programs[J];Journal of Computer Research and Development;1986-04
8 Sun Qiang Shen Jianhua Gu Junzhong(Department of Computer Science and Technology,East China Normal University,Shanghai200062);An Improved Algorithm of the Dijkstra Algorithm[J];Computer Engineering and Applications;2002-03
9 SUN QiangSHEN JjanhuaGU Junzhong( Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062);An Efficient Enumerating Algorithm of Generating All Heaps[J];Computer Engineering;2002-06
10 SUN QiangWANG RenwuHUANG Guoxing(Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062);A New Algorithm of the Shortest Path ProblemWith Single Restriction and Multiple Weights[J];Computer Engineering;2002-08
【Co-references】
Chinese Journal Full-text Database 3 Hits
1 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);Isomorphism Testing Algorithm for Graphs:Incidence Degree Sequence Method and Applications[J];Journal of Fudan University;2001-03
2 LIU Gui-zhen, YU Ji-guo & XIE Li-tong (School of Math. and System Sci., Shandong Univ., Jinan 250100, Shandong, China);Necessary and sufficient conditions of isomorph for two classes of graphs[J];Journal of Shandong University(Natural Science);2003-03
3 LI Feng, SHANG Hui liang (Department of Electronic Engineering, Fudan University, Shanghai200433, China);An Isomorphism Testing Algorithm for Directed Graphs: the In-degree and Out-degree Sequence Method[J];Journal of Applied Sciences;2002-03
【Secondary References】
Chinese Journal Full-text Database 2 Hits
1 JIANG Tao(Department of Computer Science,Bijie University,Bijie,Guizhou ? 551700,China);A Sufficient and Necessary Condition for Regular Graph Isomorphism Identification[J];Journal of Bijie University;2010-04
2 Yang Jijun1 Xu Weisheng2 Wu Qidi2 Wang Guangjing1(1 School of Economics and Management, Tongji University, Shanghai 201804, China)(2 School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China);No-cooperative games for multiple emergency locations in resource scheduling[J];东南大学学报(英文版);2008-S1
China Proceedings of conference Full-text Database 1 Hits
1 Zhang Fan,Wang Bin,and Wang Guoren (College of Information Science and Engineering,Northeastern University,Shenyang 110004);An Index Method for Similarity Matching on Graph Database[A];[C];2008
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved