Filter Results:
- Full text PDF available (52)
Publication Year
1986
2018
- This year (5)
- Last 5 years (36)
- Last 10 years (74)
Publication Type
Co-author
Journals and Conferences
Learn More
- Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul
- IEEE/ACM Trans. Comput. Biology Bioinform.
- 2007
- Emeric Gioan, Christophe Paul
- Discrete Applied Mathematics
- 2012
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary… (More)
- Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
- PODC
- 2004
- Cyril Gavoille, Christophe Paul
- Electronic Notes in Discrete Mathematics
- 2000
We consider the problem of labeling the nodes of an n-node graph G with short labels in such a way that the distance between any two nodes u, v of G can be approximated efficiently (in constant time)… (More)
- Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
- Theor. Comput. Sci.
- 2000
By making use of lexicographic breadth rst search (Lex-BFS) and partition re nement with pivots, we obtain very simple algorithms for some well-known problems in graph theory. We give a O(n + m log… (More)
- Michel Habib, Christophe Paul, Laurent Viennot
- Int. J. Found. Comput. Sci.
- 1999
- Stéphane Bessy, Fedor V. Fomin, +4 authors Stéphan Thomassé
- J. Comput. Syst. Sci.
- 2011
- Michel Habib, Christophe Paul
- Computer Science Review
- 2010
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular… (More)
- Eun Jung Kim, Alexander Langer, +4 authors Somnath Sikdar
- ICALP
- 2013
In the rst part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy… (More)