LINEAR TIME AUTOMORPHISM ALGORITHMS FOR TREES, INTERVAL-GRAPHS, AND PLANAR GRAPHS

被引：56

作者：

COLBOURN, CJ ^{[1
]}

BOOTH, KS ^{[1
]}

机构：

[1] UNIV WATERLOO, DEPT COMP SCI, WATERLOO N2L 3G1, ONTARIO, CANADA

来源：

关键词：

D O I：

10.1137/0210015

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：203 / 225

页数：23

共 39 条

[21]

LEDERBERG J, 1964, CR57029 NASA TECHN R

[22] LINEAR TIME ALGORITHM FOR DECIDING INTERVAL GRAPH ISOMORPHISM [J].

LUEKER, GS ;

BOOTH, KS .

[23] NOTE ON THE GRAPH ISOMORPHISM COUNTING PROBLEM [J].

MATHON, R .

[24]

Mitchell S., 1977, THESIS U VIRGINIA

[25]

POLYA G, 1937, ACTA MATH, V68, P154

[26]

Read R. C., 1977, J GRAPH THEOR, V1, P339, DOI DOI 10.1002/JGT.3190010410

[27]

SCOINS HI, 1968, MACH INTELL, V3, P43

[28] FAST EQUIVALENCE-CHECKING ALGORITHM FOR CIRCULAR LISTS [J].

SHILOACH, Y .

[29]

SHILOACH Y, UNPUBLISHED

[30]

SYSLO MM, 1978, BEITRAGE GRAPHENTEOR, P259