An algorithm for determining the automorphism partitioning of an undirected graph |
| |
| Authors: | D. G. Corneil |
| |
| Affiliation: | (1) Department of Computer Science, University of Toronto, Toronto, Ontario, Canada |
| |
| Abstract: | An Algol 60 program for determining the automorphism partitioning of an undirected unlabelled graph is presented. For graphs that do not contain strongly regular subgraphs, the time is at worstO(n4) wheren is the number of vertices in the graph. The algorithm is based on the Corneil-Gotlieb conjecture. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
