|
Search the dblp DataBase
Marie-Claude Heydemann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of complete binary trees into star graphs with congestion 1. [Citation Graph (0, 0)][DBLP] HICSS (2), 1995, pp:546-554 [Conf]
- Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Hypercubes and Grids into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP] ICPP (3), 1992, pp:28-37 [Conf]
- A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embedding Complete Binary Trees into Star Networks. [Citation Graph (0, 0)][DBLP] MFCS, 1994, pp:266-275 [Conf]
- Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Shuffle-Like Graphs in Hyphercubes. [Citation Graph (0, 0)][DBLP] PARLE (1), 1991, pp:179-190 [Conf]
- Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. [Citation Graph (0, 0)][DBLP] SIROCCO, 1996, pp:241-254 [Conf]
- Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Longest paths in digraphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 1981, v:1, n:4, pp:337-341 [Journal]
- Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann
Uniform emulations of Cartesian-product and Cayley graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:37-54 [Journal]
- Dominique Barth, Marie-Claude Heydemann
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:77, n:2, pp:99-118 [Journal]
- Dominique Barth, Marie-Claude Heydemann
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:80, n:1, pp:115- [Journal]
- Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Cycles in the cube-connected cycles graph. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:135-155 [Journal]
- Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau
Forwarding Indices of k-Connected Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:287-296 [Journal]
- Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:297-317 [Journal]
- Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann
Uniform homomorphisms of de Bruijn and Kautz networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:279-301 [Journal]
- Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
Complete Rotations in Cayley Graphs. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2001, v:22, n:2, pp:179-196 [Journal]
- Marie-Claude Heydemann, Dominique Sotteau
A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:5, pp:255-259 [Journal]
- Marie-Claude Heydemann, Dominique Sotteau
About some cyclic properties in digraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:261-278 [Journal]
- Marie-Claude Heydemann
Spectral characterization of some graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:307-312 [Journal]
- Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Hypercubes and Grids into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:104-111 [Journal]
- A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embedding Complete Binary Trees Into Star and Pancake Graphs. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1998, v:31, n:3, pp:279-305 [Journal]
- Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau
Spanners of Hypercube-Derived Networks. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:1, pp:37-54 [Journal]
- Rabah Harbane, Marie-Claude Heydemann
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:263, n:1-2, pp:173-189 [Journal]
- Marie-Claude Heydemann
On cycles and paths in digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1980, v:31, n:2, pp:217-219 [Journal]
- Marie-Claude Heydemann
Cycles in strong oriented graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:38, n:2-3, pp:185-190 [Journal]
- Marie-Claude Heydemann
Degrees and cycles in digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:41, n:3, pp:241-251 [Journal]
- Marie-Claude Heydemann, Dominique Sotteau
Number of arcs and cycles in digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:52, n:2-3, pp:199-207 [Journal]
- Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
A parameter linked with G-factors and the binding number. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:91, n:3, pp:311-316 [Journal]
On forwarding indices of networks. [Citation Graph (, )][DBLP]
Search in 0.057secs, Finished in 0.059secs
|