2 papers
cs.DS2024
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…
cs.DS2024
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…