3 citations · 8 across the 3 of their papers we have counts for
3 papers · 1 filter
On the Termination of Some Biclique Operators on Multipartite Graphs
Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan
We define a new graph operator, called the weak-factor graph, which comes from the context of complex network modelling. The weak-factor operator is close to the well-known clique-…
Termination of Multipartite Graph Series Arising from Complex Network Modelling
Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle +1
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model…
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
Christophe Crespelle, Tien-Nam Le, Kevin Perrot +1
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity induces…