Comments:

Read the paper, add your comments…

Comments:

Page with a link to the code: http://www.biotec.tu-dresden.de/research/schroeder/powergraphs/
Read the paper, add your comments…

Comments:

Hello, are you aware of any open source implementation of this algorithm ?
Some nice presentations on the topic: - https://www.irif.fr/~habib/Documents/cours_4-2015.pdf - http://igm.univ-mlv.fr/AlgoB/algoperm2012/04Paul.pdf - http://www.lirmm.fr/~paul/Talks/talk-06-algo-sem-McGill.pdf
>See table 3 from https://arxiv.org/abs/1811.10705 This is with $n=50$ nodes. It seems that the behavior is not the same for $n$ large: - I think that in a large ER, if the proba of connection $p$ is not too large or too small, then it is rare to find a group of nodes with the same neighbors outside the group (i.e. find a module). Can you prove that? - I don't think that the code https://github.com/antonovvk/decmod is buggy.
[Almost all finite graphs are asymmetric](https://en.wikipedia.org/wiki/Asymmetric_graph#Random_graphs). There is no pair of vertices with common neighborhood.
Read the paper, add your comments…

Comments:

Read the paper, add your comments…

Comments:

An improvement to Boldi-Vigna WebGraph. It uses Huffman coding, asymmetric numeral systems (a form of arithmetic coding) and a new hybrid integer encoding schema. The paper also mentions other algorithms like [Log(Graph) by Besta et al.](https://www.youtube.com/watch?v=j98N9nthr0M) and Apostolico-Drovandi method together with $k^2$-trees, 2D block trees, ZipG graph store... Author suggest the [Besta-Hoefler survey (2018) with more than 460 references](https://arxiv.org/abs/1806.01799) to any reader interested in lossless graph compression methods. The paper does not consider node permutations. The code is in [google's github account](https://github.com/google/zuckerli).
Read the paper, add your comments…
Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42