#### Filter Results:

- Full text PDF available (61)

#### Publication Year

1978

2018

- This year (6)
- Last 5 years (27)
- Last 10 years (56)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michel Habib
- Brain : a journal of neurology
- 2000

Five to ten per cent of school-age children fail to learn to read in spite of normal intelligence, adequate environment and educational opportunities. Thus defined, developmental dyslexia (hereafterâ€¦ (More)

- Alain Cournier, Michel Habib
- CAAP
- 1994

We present here a new algorithm linear in time and space complexity for Modular Decomposition. This algorithm relies on structural properties of prime graphs (see theorems 7, and 8), on properties ofâ€¦ (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, Dominique Gayraud, Aude Oliva, Jean RÃ©gis, Ramzi Khalil
- Brain and Cognition
- 1991

In view of conflicting data in the existing literature, we examined 53 normal subjects using a handedness questionnaire and callosal area measurements obtained from midsagittal MRI images. Theâ€¦ (More)

- Michel Habib, Christophe Paul, Laurent Viennot
- Int. J. Found. Comput. Sci.
- 1999

- ClÃ©mence Magnien, Matthieu Latapy, Michel Habib
- ACM Journal of Experimental Algorithmics
- 2008

The diameter of a graph is among its most basic parameters. Since a few years ago, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However,â€¦ (More)

- 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)

- M. Chein, Michel Habib, Muriel C Maurer
- Discrete Mathematics
- 1981

In this section we deal with finite, undirected, loopless graphs without multiple edges. The vertex set and the edge set of a graph G will be denoted V(G) and E(G) respectively. For x E V(G) weâ€¦ (More)

- Michel Habib, Bernard PÃ©roche
- Discrete Mathematics
- 1982

- Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard PÃ©roche
- Discrete Mathematics
- 1984

â€˜In general, we follow the graph-theor~.tical tamino~ogy of [3]. A hem-kforest of an undirected graph G is a subgra:?h of G wheie connected ODmponents are chains of length at most k. We define theâ€¦ (More)