On Graph Representation with Smallest Numerical Encoding

The study of succinct representation of graphs has received relevant attention to allow efficiency in modeling interconnected systems. Related work on graph representation has achieved compact encodings by benefiting from structural regularities, such as triangularity, separability, planarity, symmetry and sparsity; whereas the case of arbitrary unstructured graphs has remained elusive. In this paper, we propose an scheme to represent arbitrary graphs by using the smallest integer number. We believe our approach is useful to represent graphs efficiently.

[1]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Joseph A. Gallian,et al.  A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.

[3]  Xin He,et al.  A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs , 2000, SIAM J. Comput..

[4]  P. John Clarkson,et al.  A Scheme for Numerical Representation of Graph Structures in Engineering Design , 2014 .

[5]  Jérémy Barbay,et al.  Succinct Representation of Labeled Graphs , 2007, Algorithmica.

[6]  Gonzalo Navarro,et al.  Fast and Compact Web Graph Representations , 2010, TWEB.

[7]  Guy E. Blelloch,et al.  Compact representations of separable graphs , 2003, SODA '03.

[8]  Paul Erdös,et al.  Representations of graphs and orthogonal latin square graphs , 1989, J. Graph Theory.

[9]  Xin He,et al.  Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings , 1999, SIAM J. Discret. Math..

[10]  J. Ian Munro,et al.  Succinct Representations of Arbitrary Graphs , 2008, ESA.

[11]  Gonzalo Navarro,et al.  Compact representation of Web graphs with extended functionality , 2014, Inf. Syst..

[12]  Victor Parque,et al.  Bijections for the numeric representation of labeled graphs , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[13]  Olivier Devillers,et al.  Optimal succinct representation of planar maps , 2006 .

[14]  Marco Rosa,et al.  Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks , 2010, WWW.

[15]  Tomoyuki Miyashita,et al.  On succinct representation of directed graphs , 2017, 2017 IEEE International Conference on Big Data and Smart Computing (BigComp).

[16]  Gregory Buehrer,et al.  A scalable pattern mining approach to web graph compression with communities , 2008, WSDM '08.

[17]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

[18]  Igor L. Markov,et al.  Graph Symmetry Detection and Canonical Labeling: Differences and Synergies , 2012, Turing-100.

[19]  Guy E. Blelloch,et al.  Succinct Representations of Separable Graphs , 2010, CPM.