Claudine Peyrat

Publication Activity (10 Years)

Years Active: 1984-2007
Publications (10 Years): 0

Publications

Bruno Martin, Claudine Peyrat
A single-copy minimal-time simulation of a torus of automata by a ring of automata. Discret. Appl. Math. 155 (16) (2007)
Christine Garcia, Claudine Peyrat
Large Cayley Graphs on an Abelian Group. Discret. Appl. Math. 75 (2) (1997)
Jean-Claude Bermond, Claudine Peyrat, I. Sakho, Maurice Tchuente
Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays. J. Parallel Distributed Comput. 33 (1) (1996)
Christine Garcia, Claudine Peyrat
Broadcasting in an n-grid with a given neighborhood template. HICSS (2) (1995)
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
Connectivity of kautz networks. Discret. Math. 114 (1-3) (1993)
Pierre Fraigniaud, Claudine Peyrat
Broadcasting in a Hypercube when Some Calls Fail. Inf. Process. Lett. 39 (3) (1991)
Nathalie Homobono, Claudine Peyrat
Graphs such that every two edges are contained in a shortest cycle. Discret. Math. 76 (1) (1989)
Nathalie Homobono, Claudine Peyrat
Fault-tolerant routings in Kautz and de Bruijn networks. Discret. Appl. Math. 24 (1-3) (1989)
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
Large fault-tolerant interconnection networks. Graphs Comb. 5 (1) (1989)
Jean-Claude Bermond, Claudine Peyrat
Induced Subgraphs of the Power of a Cycle. SIAM J. Discret. Math. 2 (4) (1989)
Nathalie Homobono, Claudine Peyrat
Connectivity of Imase and Itoh Digraphs. IEEE Trans. Computers 37 (11) (1988)
Terunao Soneoka, Hiroshi Nakada, Makoto Imase, Claudine Peyrat
Sufficient conditions for maximally connected dense graphs. Discret. Math. 63 (1) (1987)
Claudine Peyrat, Douglas F. Rall, Peter J. Slater
On iterated clique graphs with increasing diameters. J. Graph Theory 10 (2) (1986)
Claudine Peyrat
Diameter vulnerability of graphs. Discret. Appl. Math. 9 (3) (1984)