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 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

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

[3]

BONDY JA, 1976, GRAPH THEORY APPLICA

BOOTH, KS ;

LUEKER, GS .

[5] LEXICOGRAPHICALLY LEAST CIRCULAR SUBSTRINGS [J].

BOOTH, KS .

[6]

BUSACKER G, 1965, FINITE GRAPHS NETWOR

[7]

COLBOURN CJ, 1977, THESIS U WATERLOO ON

[8]

CORNEIL DG, 1968, THESIS U TORONTO ONT

[9]

FONTET M, 1976, 3RD P C AUT LANG PRO, P411

[10]

GUY R, 1958, B MALAYAN MATH SOC, V5, P56