3 citations · 7 across the 3 of their papers we have counts for
6 papers
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…
Faster and Enhanced Inclusion-Minimal Cograph Completion
Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan +1
We design two incremental algorithms for computing an inclusion-minimal completion of an arbitrary graph into a cograph. The first one is able to do so while providing an additiona…
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…
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model
Kevin Perrot, Thi Ha Duong Phan, Trung Van Pham
Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of Self-Organized Criticality. From a configuration composed of a finite number of stacked grains, we app…
Lattice Structure and Convergence of a Game of Cards
Eric Goles, Michel Morvan, Ha Duong Phan
This paper is devoted to the study of the dynamics of a discrete system related to some self stabilizing protocol on a ring of processors.