REFINED VERTEX CODES AND VERTEX PARTITIONING METHODOLOGY FOR GRAPH ISOMORPHISM TESTING

被引：5

作者：

BHAT, KVS ^{[1
]}

机构：

[1] OHIO STATE UNIV, DEPT COMP & INFORMAT SCI, COLUMBUS, OH 43210 USA

来源：

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1980年 / 10卷 / 10期

关键词：

D O I：

10.1109/TSMC.1980.4308365

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：610 / 615

页数：6

共 37 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2] BACKTRACK PROCEDURE FOR ISOMORPHISM OF DIRECTED GRAPHS [J].

BERZTISS, AT .

[3]

BEYER T, 1979, J ACM, V26, P603, DOI 10.1145/322154.322155

[4]

BHAT KKS, UNPUBLISHED

[5]

BHAT KVS, 1980, APR P IEEE INT S CIR, P363

BOOTH, KS .

BOSE, RC .

[8]

CHANG LC, 1950, SCI, P12

[9] AN EFFICIENT ALGORITHM FOR GRAPH ISOMORPHISM [J].

CORNEIL, DG ;

GOTLIEB, CC .

[10]

CORNEIL DG, 1968, THESIS U TORONTO ONT