
Accession Number : AD0755140
Title : Constructive Graph Labeling Using Double Cosets,
Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Personal Author(s) : Brown,Harold ; Masinter,Larry ; Hjelmeland,Larry
Report Date : OCT 1972
Pagination or Media Count : 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. (Author)
Descriptors : (*MATHEMATICAL LOGIC, GRAPHICS), (*COMPUTER PROGRAMMING, ALGORITHMS), SET THEORY, ALGEBRA, TOPOLOGY, COMBINATORIAL ANALYSIS, GROUPS(MATHEMATICS), ARTIFICIAL INTELLIGENCE
Subject Categories : Theoretical Mathematics
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE