ISOMORPHISM OF GRAPHS OF BOUNDED VALENCE CAN BE TESTED IN POLYNOMIAL-TIME

被引：340

作者：

LUKS, EM

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(82)90009-5

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：42 / 65

页数：24

共 26 条

[1]

ATKINSON MD, 1975, MATH COMPUT, V29, P911, DOI 10.1090/S0025-5718-1975-0367030-3

[2]

BABAI L, 1981, P C FUND COMP THY SZ

[3]

BABAI L, UNPUB SUBEXPONENTIAL

[4]

BABAI L, UNPUB ORDER PRIMITIV

[5]

BABAI L A S O, 1979, MONTE CARLO ALGORITH

[6] FINITE PERMUTATION-GROUPS AND FINITE SIMPLE-GROUPS [J].

CAMERON, PJ .

[7]

Carter R., 1964, J ALGEBRA, V1, P139

[8]

Furst M., 1980, 21st Annual Symposium on Foundations of Computer Science, P36, DOI 10.1109/SFCS.1980.34

[9]

FURST M, 1980, 80426 CORN U TECH RE

[10]

HALL M, 1959, THEORY GROUPS