Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bermond, J.C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
J.C. Bermond
,
J.M. Fourneau
Theoretical Computer Science
64
, 1989, pp. 191-201
Independent Connections: An Easy Characterization of Baseline-equivalent Multistage Interconnection Networks
J.C. Bermond
,
J.M. Fourneau
Proceedings of the 1988 International Conference on Parallel Processing. Vol.~I Architecture, ICPP'88 (St.~Charles, IL, August 15-19, 1988)
, 1988, pp. 187-190
Equivalence of multistage interconnection networks
J.C. Bermond
,
J.M. Fourneau
,
A. Jean-Marie
Information Processing Letters
26
(1), 1987, September, pp. 45-50
Large graphs with given degree and diameter. II
J.C. Bermond
,
C. Delorme
,
G. Farhi
Journal of Combinatorial Theory Series B
36
(1), 1984, February, pp. 32-48
Longest paths in digraphs
J.C. Bermond
,
A. Germa
,
M.C. Heydemann
,
D. Sotteau
Combinatorica
1
, 1981, pp. 337-341
Cycles in digraphs - A survey
J.C. Bermond
,
C. Thomassen
Journal of Graph Theory
5
(1), 1981, pp. 1-43
Girth in digraphs
J.C. Bermond
,
A. Germa
,
M.C. Heydemann
,
D. Sotteau
Journal of Graph Theory
4
(3), 1980, pp. 337-341
Resolvable decomposition of
K^*_n
J.C. Bermond
,
A. Germa
,
D. Sotteau
Journal of Combinatorial Theory Series A
26
, 1979, pp. 179-185
Decomposition of the complete directed graph into
k
-circuits
J.C. Bermond
,
V. Faber
Journal of Combinatorial Theory Series B
21
, 1976, pp. 146-155
An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
J.C. Bermond
Discrete Mathematics
8
(3), 1974, pp. 301-304
Some Ramsey numbers for directed graphs
J.C. Bermond
Discrete Mathematics
9
(4), 1974, pp. 313-321