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
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=37/38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some large trivalent graphs having small diameters
William M. Kantor
Discrete Applied Mathematics
37/38
, 1992, pp. 353-357
Cost-performance tradeoffs for interconnection networks
Clyde P. Kruskal
,
Marc Snir
Discrete Applied Mathematics
37/38
, 1992, pp. 359-385
Broadcasting in DMA-bound bounded degree graphs
E. Lazard
Discrete Applied Mathematics
37/38
, 1992, pp. 387-400
Minimum broadcast digraphs
Arthur L. Liestman
,
Joseph G. Peters
Discrete Applied Mathematics
37/38
, 1992, pp. 401-419
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Ueli M. Maurer
Discrete Applied Mathematics
37/38
, 1992, pp. 421-436
The asymptotic optimality of spider-web networks
Nicholas Pippenger
Discrete Applied Mathematics
37/38
, 1992, pp. 437-450
Heuristics for the Steiner problem in graphs
J. Plesník
Discrete Applied Mathematics
37/38
, 1992, pp. 451-463
Product-shuffle networks: Toward reconciling shuffles and butterflies
Arnold L. Rosenberg
Discrete Applied Mathematics
37/38
, 1992, pp. 465-488
Generating the states of a binary stochastic system
D.R. Shier
,
E.J. Valvo
,
R.E. Jamison
Discrete Applied Mathematics
37/38
, 1992, pp. 489-500
The covering radius of Hadamard codes in odd graphs
Patrick Solé
,
Arif Ghafoor
,
Sohail A. Sheikh
Discrete Applied Mathematics
37/38
, 1992, pp. 501-510
Super edge-connectivity of dense digraphs and graphs
Terunao Soneoka
Discrete Applied Mathematics
37/38
, 1992, pp. 511-523
The underlying graph of a line digraph
J.L. Villar
Discrete Applied Mathematics
37/38
, 1992, pp. 525-538
Efficient fault-tolerant fixed routings on
(k+1)
-connected digraphs
Koichi Wada
,
Kimio Kawaguchi
Discrete Applied Mathematics
37/38
, 1992, pp. 539-552
Application of coding theory to interconnection networks
Gilles Zémor
,
Gérard D. Cohen
Discrete Applied Mathematics
37/38
, 1992, pp. 553-562
Chordal rings as fault-tolerant loops
Guy W. Zimmermann
,
Abdol-Hossein Esfahanian
Discrete Applied Mathematics
37/38
, 1992, pp. 563-573
Table of large
(\Delta, D)
-graphs
J.-C. Bermond
,
C. Delorme
,
J.J. Quisquater
Discrete Applied Mathematics
37/38
, 1992, pp. 575-577
Seiten
<
1
2