NOTE ON THE GRAPH ISOMORPHISM COUNTING PROBLEM

被引：104

作者：

MATHON, R

机构：

[1] Department of Computer Science, University of Toronto, Toronto

来源：

关键词：

counting; Graph; isomorphism; polynomial reduction;

D O I：

10.1016/0020-0190(79)90004-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：131 / 132

页数：2

共 9 条

[1]

Bentley, Maurer, Efficient worst-case data structures for range searching, Report 10, (1978)

[2]

Bentley, Stanat, Williams, The complexity of finding fixed-radius near neighbours, Information Processing Lett., 6, pp. 209-212, (1977)

[3]

Lee, Preparata, Location of a point in a planar subdivision and its applications, SIAM Journal on Computing, 6, 3, pp. 594-606, (1977)

[4]

Lipton, Tarjan, Applications of a planar separator theorem, 18th FOCS Conference, pp. 162-170, (1977)

[5]

Liu, Introduction to Combinatorial Mathematics, (1968)

[6]

Shamos, Geometric complexity, 7th Annual ACM STOC Symposium, pp. 224-233, (1975)

[7]

Shamos, Hoey, Closest point problems, 16th FOCS Conference, pp. 151-162, (1975)

[8]

Yuval, Finding nearest neighbours, Information Processing Lett., 5, pp. 63-65, (1976)

[9]

Dobkin, Lipton, Multidimensional searching problems, SIAM Journal on Computing, 5, 2, pp. 181-186, (1976)