Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/graph-automorphisms-for-compression-MjwyPxniZd
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- de Gruyter
- Copyright
- © 2021 Uroš Čibej et al., published by De Gruyter
- eISSN
- 2299-1093
- DOI
- 10.1515/comp-2020-0186
- Publisher site
- See Article on Publisher Site
Abstract
AbstractDetecting automorphisms is a natural way to identify redundant information presented in structured data. When such redundancies are detected they can be used for data compression. In this paper we explore two different classes of graphs to capture this intuitive property of automorphisms. Symmetry-compressible graphs are the first class which introduces the basic concepts but use only global symmetries for the compression. In order for this concept to be more practical, we need to use local symmetries. Thus, we extend the basic graph class with Near Symmetry compressible graphs. Furthermore, we develop two algorithms that can be used to compress practical instances and empirically evaluate them on a set of realistic graphs.
Journal
Open Computer Science – de Gruyter
Published: Jan 1, 2021
Keywords: graph automorphisms; graph classes; compression algorithms