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.
New
(\Delta, D)
graphs discovered by heuristic search
James Allwright
Discrete Applied Mathematics
37/38
, 1992, pp. 3-8
Transmitting in the
n
-dimensional cube
Noga Alon
Discrete Applied Mathematics
37/38
, 1992, pp. 9-11
A survey of integrity
K.S. Bagga
,
L.W. Beineke
,
W.D. Goddard
,
M.J. Lipman
,
R.E. Pippert
Discrete Applied Mathematics
37/38
, 1992, pp. 13-28
Connections between two cycles - a new design of dense processor interconnection networks
Reuven Bar-Yehuda
,
Tuvi Etzion
Discrete Applied Mathematics
37/38
, 1992, pp. 29-43
Design and analysis of fault-tolerant multibus interconnection networks
Pietro Camarda
,
Mario Gerla
Discrete Applied Mathematics
37/38
, 1992, pp. 45-64
Dense group networks
Lowell Campbell
Discrete Applied Mathematics
37/38
, 1992, pp. 65-71
Graphs with small diameter after edge deletion
F.R.K. Chung
Discrete Applied Mathematics
37/38
, 1992, pp. 73-94
New methods for using Cayley graphs in interconnection networks
Gene Cooperman
,
Larry Finkelstein
Discrete Applied Mathematics
37/38
, 1992, pp. 95-118
Stirling networks: A versatile combinatorial topology for multiprocessor systems
Sajal K. Das
,
Joydeep Ghosh
,
Narsingh Deo
Discrete Applied Mathematics
37/38
, 1992, pp. 119-146
The forwarding index of communication networks with given connectivity
W. Fernandez de la Vega
,
Y. Manoussakis
Discrete Applied Mathematics
37/38
, 1992, pp. 147-155
Examples of products giving large graphs with given degree and diameter
C. Delorme
Discrete Applied Mathematics
37/38
, 1992, pp. 157-167
Connectivity of consecutive-
d
digraphs
D.-Z. Du
,
D.F. Hsu
,
G.W. Peck
Discrete Applied Mathematics
37/38
, 1992, pp. 169-177
Generalized degrees and Menger path systems
R.J. Faudree
,
R.J. Gould
,
L.M. Lesniak
Discrete Applied Mathematics
37/38
, 1992, pp. 179-191
A new look at the de Bruijn graph
Harold Fredricksen
Discrete Applied Mathematics
37/38
, 1992, pp. 193-203
Connectivity, persistence and fault diagnosis of interconnection networks based on
O_k
and
2O_k
graphs
Arif Ghafoor
Discrete Applied Mathematics
37/38
, 1992, pp. 205-226
Graphs on alphabets as models for large interconnection networks
J. Gómez
,
M.A. Fiol
,
J.L.A. Yebra
Discrete Applied Mathematics
37/38
, 1992, pp. 227-243
Analysis of minimal path routing schemes in the presence of faults
Jesse M. Gordon
Discrete Applied Mathematics
37/38
, 1992, pp. 245-263
Changing and unchanging the diameter of a hypercube
Niall Graham
,
Frank Harary
Discrete Applied Mathematics
37/38
, 1992, pp. 265-274
The connectivity of hierarchical Cayley digraphs
Y.O. Hamidoune
,
A.S. Llado
,
O. Serra
Discrete Applied Mathematics
37/38
, 1992, pp. 275-280
Perfect Latin squares
Katherine Heinrich
,
Kichul Kim
,
V.K. Prasanna Kumar
Discrete Applied Mathematics
37/38
, 1992, pp. 281-286
Forwarding indices of
k
-connected graphs
M.C. Heydemann
,
J.C. Meyer
,
J. Opatrny
,
D. Sotteau
Discrete Applied Mathematics
37/38
, 1992, pp. 287-296
Broadcasting and spanning trees in de Bruijn and Kautz networks
M.C. Heydemann
,
J. Opatrny
,
D. Sotteau
Discrete Applied Mathematics
37/38
, 1992, pp. 297-317
Nonblocking self-routing switching networks
H.D.L. Hollmann
,
J.H. van, Jr. Lint
Discrete Applied Mathematics
37/38
, 1992, pp. 319-340
An improved upper bound for the subarray partial concentrators
X.D. Hu
,
F.K. Hwang
Discrete Applied Mathematics
37/38
, 1992, pp. 341-346
Diameters of cubic graphs
Leif K. Jrgensen
Discrete Applied Mathematics
37/38
, 1992, pp. 347-351
Seiten 1
2
>