Marie-Claude Heydemann

According to our database1, Marie-Claude Heydemann authored at least 30 papers between 1977 and 2002.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Uniform emulations of Cartesian-product and Cayley graphs.
Discret. Appl. Math., 2002

2001
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays.
Theor. Comput. Sci., 2001

Complete Rotations in Cayley Graphs.
Eur. J. Comb., 2001

2000
Rotational Cayley Graphs on Transposition Generated Groups.
Electron. Notes Discret. Math., 2000

1998
Embedding Complete Binary Trees Into Star and Pancake Graphs.
Theory Comput. Syst., 1998

Uniform homomorphisms of de Bruijn and Kautz networks.
Discret. Appl. Math., 1998

Cycles in the cube-connected cycles graph.
Discret. Appl. Math., 1998

1997
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
Discret. Appl. Math., 1997

1996
Spanners of Hypercube-Derived Networks.
SIAM J. Discret. Math., 1996

Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*.
Parallel Algorithms Appl., 1996

Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.
Proceedings of the SIROCCO'96, 1996

1995
A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs.
Inf. Process. Lett., 1995

Embeddings of complete binary trees into star graphs with congestion 1.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Forwarding indices of consistent routings and their complexity.
Networks, 1994

Embeddings of Hypercubes and Grids into de Bruijn Graphs.
J. Parallel Distributed Comput., 1994

Embedding Complete Binary Trees into Star Networks.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1992
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.
Discret. Appl. Math., 1992

Forwarding Indices of <i>k</i>-Connected Graphs.
Discret. Appl. Math., 1992

1991
Embeddings of Shuffle-Like Graphs in Hyphercubes.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1990
A parameter linked with G-factors and the binding number.
Discret. Math., 1990

1989
On forwarding indices of networks.
Discret. Appl. Math., 1989

1985
About some cyclic properties in digraphs.
J. Comb. Theory B, 1985

1984
Number of arcs and cycles in digraphs.
Discret. Math., 1984

1982
Degrees and cycles in digraphs.
Discret. Math., 1982

Cycles in strong oriented graphs.
Discret. Math., 1982

1981
Longest paths in digraphs.
Comb., 1981

1980
Girth in digraphs.
J. Graph Theory, 1980

On cycles and paths in digraphs.
Discret. Math., 1980

1978
Spectral characterization of some graphs.
J. Comb. Theory B, 1978

1977
Line graphs of hypergraphs I.
Discret. Math., 1977


  Loading...