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="Park, Jung-Heum"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
Hee-Chul Kim
,
Hyeong-Seok Lim
,
Jung-Heum Park
Theoretical Computer Science
548
, 2014, pp. 98-116
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
Paired many-to-many disjoint path covers in faulty hypercubes
Shinhaeng Jo
,
Jung-Heum Park
,
Kyung-Yong Chwa
Theoretical Computer Science
513
, 2013, pp. 1-24
Single-source three-disjoint path covers in cubes of connected graphs
Jung-Heum Park
,
Insung Ihm
Information Processing Letters
113
(14-16), 2013, pp. 527-532
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
Strong matching preclusion
Jung-Heum Park
,
Insung Ihm
Theoretical Computer Science
412
(45), 2011, pp. 6409-6419
Conditional matching preclusion for hypercube-like interconnection networks
Jung-Heum Park
,
Sang Hyuk Son
Theoretical Computer Science
410
(27-29), 2009, pp. 2632-2640
Panconnectivity and edge-pancyclicity of faulty recursive circulant
G(2^m,4)
Jung-Heum Park
Theoretical Computer Science
390
(1), 2008, pp. 70-80
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Jung-Heum Park
,
Hyeong-Seok Lim
,
Hee-Chul Kim
Theoretical Computer Science
377
(1-3), 2007, pp. 170-180
Many-to-many disjoint path covers in a graph with faulty elements
Jung-Heum Park
,
Hee-Chul Kim
,
Hyeong-Seok Lim
Lecture Notes in Computer Science
3341
, 2004, pp. 742-753
Longest paths and cycles in faulty star graphs
Jung-Heum Park
,
Hee-Chul Kim
Journal Parallel Distributed Computing
64
(11), 2004, pp. 1286-1296
Fault Hamiltonicity of meshes with two wraparound edges
Kyoung-Wook Park
,
Hyeong-Seok Lim
,
Jung-Heum Park
,
Hee-Chul Kim
Lecture Notes in Computer Science
3106
, 2004, pp. 412-421
One-to-many disjoint path covers in a graph with faulty elements
Jung-Heum Park
Lecture Notes in Computer Science
3106
, 2004, pp. 392-401
Fault-Hamiltonicity of product graph of path and cycle
Jung-Heum Park
,
Hee-Chul Kim
Lecture Notes in Computer Science
2697
, 2003, pp. 319-328
Recursive circulants and their embeddings among hypercubes
Jung-Heum Park
,
Kyung-Yong Chwa
Theoretical Computer Science
244
(1-2), 2000, pp. 35-62
Dihamiltonian decomposition of regular graphs with degree three
Jung-Heum Park
,
Hee-Chul Kim
Lecture Notes in Computer Science
1665
, 1999, pp. 240-249
Hamiltonian decomposition of recursive circulants
Jung-Heum Park
Lecture Notes in Computer Science
1533
, 1998, pp. 297-306
Embedding trees in recursive curculants
Hyeong-Seok Lim
,
Jung-Heum Park
,
Kyung-Yong Chwa
Discrete Applied Mathematics
69
(1-2), 1996, pp. 83-99
An optimal algorithm for finding the edge visibility polygon under limited visibility
Sung-Ho Kim
,
Jung-Heum Park
,
Seung-Hak Choi
,
Sung Yong Shin
,
Kyung-Yong Chwa
Information Processing Letters
53
, 1995, pp. 359-365
Recursive circulant: A new topology for multicomputer networks
Jung-Heum Park
,
Kyung-Yong Chwa
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) (Kanazawa, Japan, December 14-16, 1994)
, 1994, pp. 73-80
On the construction of regular minimal broadcast digraphs
Jung-Heum Park
,
Kyung-Yong Chwa
Theoretical Computer Science
124
(2), 1994, pp. 329-342