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: Author="Faber, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian
F.R.K. Chung
,
V. Faber
,
Thomas A. Manteuffel
SIAM Journal on Discrete Mathematics
7
(3), 1994, August, pp. 443-457
Modeling the performance of hypercubes: A case study using the particle-in-cell application
Olaf M. Lubeck
,
V. Faber
Parallel Computing
9
(1), 1988/89, pp. 37-52
Superlinear speedup of an efficient sequential algorithm is not possible
V. Faber
,
Olaf M. Lubeck
,
Andrew B., Jr. White
Parallel Computing
3
(3), 1986, pp. 259-260
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
Graphs with valency
k
, edge connectivity
k
, chromatic index
k+1
and arbitrary girth
V. Faber
,
J. Mycielski
Discrete Mathematics
4
, 1973, pp. 339-345