Martin Nehéz
ABSTRACT
In this paper, we address the problem of the trade-off between the compact memory representation of graphs and their amount of randomness. We design a representation (abbreviated as DBP representation) which does not use information on the structure of graphs, hence it is generally usable. Based on our theoretical lower bound on graph space representation, we define a compression ratio for a given graph with respect to the DBP representation. Based on experimental results, we derive the empirical relationship between the amount of randomness and the compression ratio.
- P. Bartalos: Effective Encoding and the Kolmogorov Complexity of the Internet. In Proc. of the Student Research Confernece, IIT.SRC 2006, SUT Publishing, Bratislava, pp. 121--128 (2006)Google Scholar
- M. Bastian, S. Heymann, M. Jacomy: Gephi: an open source software for exploring and manipulating networks. In Proc. of the 3rd Int. AAAI Conference on Weblogs and Social media, ICWSM 2009, The AAAI Press, pp. 361--362 (2009)Google Scholar
- D. K. Blandford, G. E. Blelloch, I. A. Kash: Compact representations of separable graphs. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, The ACM/SIAM Press, pp. 679--688 (2003) Google ScholarDigital Library
- G. E. Blelloch, A. Farzan: Succinct Representations of Separable Graphs. In Proc. of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Springer, LNCS 6129, pp. 138--150 (2010) Google ScholarDigital Library
- P. Boldi, S. Vigna: (Web/Social) Graph Compression. Encyclopedia of Big Data Technologies (S. Sakr and A. Y. Zomaya eds.), Springer, pp. 1800--1804 (2019)Google Scholar
- P. Boldi, S. Vigna: The webgraph framework I: compression techniques. In Proc. of the 13th Int. Conference on World Wide Web, WWW 2004, ACM Press, pp. 595--602 (2004) Google ScholarDigital Library
- T. Bu, D. F. Towsley: On Distinguishing between Internet Power Law Topology Generators. In Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 2002, pp. 638--647 (2002)Google Scholar
- F. Claude, G. Navarro: Fast and Compact Web Graph Representations. ACM Transactions on The Web, 4(4), pp. 16:1-16:31 (2010) Google ScholarDigital Library
- A. Farzan, J. I. Munro: Succinct encoding of arbitrary graphs, Theor. Comput. Science, 513, pp. 38--52 (2013) Google ScholarDigital Library
- S. á. García: Compact and Efficient Representations of Graphs. PhD Thesis, Departamento de Computación, Facultad de Informática, Universidade da Coruña (2014)Google Scholar
- Inet Topology Generator. Download Web-page, URL: http://topology.eecs.umich.edu/inet/Google Scholar
- S. Janson, T. Luczak, A. Rucinski: Random Graphs. John Wiley & Sons, New York (2000)Google Scholar
- M. Li, P. Vitányi: An introduction to Kolmogorov complexity and its applications (2nd ed.). Springer-Verlag New York, Inc., Secaucus, NJ, USA (1997) Google ScholarDigital Library
- C. C. McGeoch: A Guide to Experimental Algorithmics. Cambridge University Press, New York (2012) Google ScholarDigital Library
- M. Nehéz, P. Bartalos: On Space Complexity of Sparse Graphs Representation. In Proc. of the 6th Conference on Applied Mathematics, APLIMAT 2007, Dept. of Mathematics, Faculty of Mechanical Engineering, SUT, Bratislava, Part III, pp. 219--226 (2007)Google Scholar
- E. M. Palmer: Graphical Evolution. John Wiley & Sons, Inc., New York (1985)Google Scholar
- S. Raghavan, H. Garcia-Molina: Representing Web Graphs. In Proc. of the 19th Int. Conference on Data Engineering, ICDE 2003, IEEE Computer Society, pp. 405--416 (2003)Google Scholar
- R. Raman, V. Raman, S. Rao Satti: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets. ACM Transactions on Algorithms, 3(4), pp. 43:1-43:25 (2007) Google ScholarDigital Library
- H. J. Rogers (Jr.).: Theory of Recursive Functions and Effective Computability. MIT Press (1987) Google ScholarDigital Library
- T. Suel, J. Yuan: Compressing the Graph Structure of the Web, Data Compression Conference, DCC 2001, IEEE Computer Society, pp. 213--222 (2001) Google ScholarDigital Library
- H. Zenil, N. A. Kiani, J. Tegner: Methods of information theory and algorithmic complexity for network biology. Seminars in Cell & Developmental Biology, 51, pp. 32--43 (2016)Google ScholarCross Ref
- Complexity Aspects of Unstructured Sparse Graph Representation
Recommendations
Exact algorithms for dominating induced matching based on graph partition
A dominating induced matching, also called an efficient edge domination, of a graph G = ( V , E ) with n = | V | vertices and m = | E | edges is a subset F E of edges in the graph such that no two edges in F share a common endpoint and each edge in E F ...
Graph partition into paths containing specified vertices
For a graph G, let σ2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163-169) conjectured that, if a partition n = Σi=1k ai is given and σ2(G) Ge; n + k - 1,...
Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$
For any integer n, let ${\cal G}$ be a probability distribution on the family of graphs on n vertices (where every such graph has nonzero probability associated with it). A graph Γ is ${\cal G}$-almost-universal if Γ satisifies the following: If G is ...
Comments