Symmetry-Compressible Graphs

This article describes an alternative representation of graphs, using symmetries. We define the class of graphs that are compressed using this representation as symmetry-compressible graphs. This class of graphs is extended into the class of near symmetry-compressible graphs, which includes many more graphs arising in practical applications. To demonstrate the practical potential of the proposed concepts, an empirical evaluation of two algorithms is given.