28 citations · 40 across the 13 of their papers we have counts for
3 papers · 1 filter
BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
Alexis Baudin, Clémence Magnien, Lionel Tabourier
Bipartite graphs are a prevalent modeling tool for real-world networks, capturing interactions between vertices of two different types. Within this framework, bicliques emerge as c…
Faster maximal clique enumeration in large real-world link streams
Alexis Baudin, Clémence Magnien, Lionel Tabourier
Link streams offer a good model for representing interactions over time. They consist of links , where and are vertices interacting during the whole time interva…
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…