28 citations · 40 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
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.DS2022
Tailored vertex ordering for faster triangle listing in large graphs
Fabrice Lécuyer, Louis Jachiet, Clémence Magnien +1
Listing triangles is a fundamental graph problem with many applications, and large graphs require fast algorithms. Vertex ordering allows the orientation of edges from lower to hig…