10 citations · 19 across the 8 of their papers we have counts for
10 papers
Dividing sums of cycles in the semiring of functional digraphs
Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan +1
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed wi…
A quasi-quadratic vertex Kernel for Cograph edge editing
Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
We provide a vertex kernel for cograph edge editing. This improves a cubic kernel found by Guillemot, Havet, Paul and Perez [1] which involved four reductio…
A graph theory-based multi-scale analysis of hierarchical cascade in molecular clouds : Application to the NGC 2264 region
B. Thomasson, I. Joncour, E. Moraux +4
The spatial properties of small star-clusters suggest that they may originate from a fragmentation cascade of the cloud for which there might be traces up to a few dozen of kAU. Ou…
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…
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…