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
[2]
Hilfe
Suche: Author="Kim, Sook-Yeon"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Sook-Yeon Kim
,
Jung-Heum Park
Theoretical Computer Science
531
, 2014, pp. 26-36
Disjoint path covers in recursive circulants
G(2^m, 4)
with faulty elements
Sook-Yeon Kim
,
Jae-Ha Lee
,
Jung-Heum Park
Theoretical Computer Science
412
(35), 2011, pp. 4636-4649
Multiple graph embeddings into a processor array with spanning buses
Sook-Yeon Kim
,
Kyung-Yong Chwa
Journal Parallel Distributed Computing
52
(1), 1998, pp. 24-39
Embeddings of butterflies into hypermeshes
Sook-Yeon Kim
,
Oh-Heum Kwon
,
Kyung-Yong Chwa
Parallel Processing Letters
8
(3), 1998, pp. 337-350
Edge-disjoint embedding of large full binary trees into hypercubes
Sook-Yeon Kim
,
Kyung-Yong Chwa
Proceedings of the seventh IEEE Symposium on Parallel and Distributed Processing (San Antonio, Texas, October 25 - 28, 1995)
, 1995, pp. 669-672