BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-72-318
       ENTRY:: October 16, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Constructive graph labeling using double cosets.
        TYPE:: Technical Report
      AUTHOR:: Brown, Harold
      AUTHOR:: Masinter, Larry M.
      AUTHOR:: Hjelmeland, Larry
        DATE:: October 1972
       PAGES:: 48
    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.
       NOTES:: [Adminitrivia V1/Prg/19951016]
         END:: STAN//CS-TR-72-318