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="Krishnamoorthy, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel algorithms for workstation clusters
K. Efe
,
P. Uthayopas
,
V. Krishnamoorthy
,
T. Dechsakulthorn
Proceedings of the 1995 ICPP Workshop on Challenges for Parallel Processing (Oconomowoc, Wisconsin, August 14, 1995)
, 1995, pp. 140-147
Incremental distance and diameter sequences of a graph: New measures for network performance
V. Krishnamoorthy
,
K. Thulasiraman
,
M.N.S. Swamy
IEEE Transactions on Computers
39
(2), 1990, February, pp. 230-237
F
-sets in graphs
V. Krishnamoorthy
,
K.R. Parthasarathy
Journal of Combinatorial Theory Series B
24
(1), 1978, February, pp. 53-60
Cospectral graphs and digraphs with given automorphism group
V. Krishnamoorthy
,
K.R. Parthasarathy
Journal of Combinatorial Theory Series B
19
, 1975, pp. 204-213
A note on nonisomorphic cospectral digraphs
V. Krishnamoorthy
,
K.R. Parthasarathy
Journal of Combinatorial Theory Series B
17
, 1974, pp. 39-40