7 citations · 11 across the 4 of their papers we have counts for
4 papers
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…
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
Alexis Baudin, Lionel Tabourier, Clémence Magnien
Community detection is a popular approach to understand the organization of interactions in static networks. For that purpose, the Clique Percolation Method (CPM), which involves t…
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…
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…