Report Number: CS-TR-72-318
Institution: Stanford University, Department of Computer Science
Title: Constructive graph labeling using double cosets.
Author: Brown, Harold
Author: Masinter, Larry M.
Author: Hjelmeland, Larry
Date: October 1972
Abstract: Two efficient computer implemented algorithms are presented for explicitly constructing all distinct labelings of a graph G with a set of (not necessarily distinct) labels L, given the symmetry group B of G. Two recursive reductions of the problem and a precomputation involving certain orbits of stabilizer subgroups are the techniques used by the algorithm. Moreover, for each labeling, the subgroup of B which preserves that labeling is calculated.