7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.SI2022
Compressing bipartite graphs with a dual reordering scheme
Maximilien Danisch, Ioannis Panagiotas, Lionel Tabourier
In order to manage massive graphs in practice, it is often necessary to resort to graph compression, which aims at reducing the memory used when storing and processing the graph. E…
cs.DS2021★ 7 cited
Clique percolation method: memory efficient almost exact communities
Alexis Baudin, Maximilien Danisch, Sergey Kirgizov +2
Automatic detection of relevant groups of nodes in large real-world graphs, i.e. community detection, has applications in many fields and has received a lot of attention in the las…