3 citations · 8 across the 3 of their papers we have counts for
7 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…
A survey of parameterized algorithms and the complexity of edge modification
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin +1
The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is…
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…
Non-Altering Time Scales for Aggregation of Dynamic Networks into Series of Graphs
Yannick Léo, Christophe Crespelle, Eric Fleury
Many dynamic networks coming from real-world contexts are link streams, i.e. a finite collection of triplets where and are two nodes having a link between them at…
The Link Stream of Contacts in a Whole Hospital
Lucie Martinet, Christophe Crespelle, Eric Fleury +2
We analyse a huge and very precise trace of contact data collected by a network of sensors during 6 months on the entire population of a rehabilitation hospital. We investigate bot…