Search the dblp DataBase
Jung-Heum Park: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jung-Heum Park
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements. [Citation Graph (0, 0)][DBLP]
COCOON, 2004, pp:392-401 [Conf] - Jung-Heum Park, Hee-Chul Kim
Fault-Hamiltonicity of Product Graph of Path and Cycle. [Citation Graph (0, 0)][DBLP]
COCOON, 2003, pp:319-328 [Conf] - Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
Fault Hamiltonicity of Meshes with Two Wraparound Edges. [Citation Graph (0, 0)][DBLP]
COCOON, 2004, pp:412-421 [Conf] - Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. [Citation Graph (0, 0)][DBLP]
IPDPS, 2005, pp:- [Conf] - Jung-Heum Park
Hamiltonian Decomposition of Recursive Circulants. [Citation Graph (0, 0)][DBLP]
ISAAC, 1998, pp:297-306 [Conf] - Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements. [Citation Graph (0, 0)][DBLP]
ISAAC, 2004, pp:742-753 [Conf] - Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements. [Citation Graph (0, 0)][DBLP]
ISPA Workshops, 2006, pp:291-300 [Conf] - Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. [Citation Graph (0, 0)][DBLP]
ISPA Workshops, 2006, pp:301-310 [Conf] - Jung-Heum Park, Hee-Chul Kim
Dihamiltonian Decomposition of Regular Graphs with Degree Three. [Citation Graph (0, 0)][DBLP]
WG, 1999, pp:240-249 [Conf] - Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa
Embedding Trees in Recursive Circulants. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1996, v:69, n:1-2, pp:83-99 [Journal] - Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, Tony C. Woo
On the Number of Guard Edges of a Polygon. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1993, v:10, n:, pp:447-462 [Journal] - Sung-Ho Kim, Jung-Heum Park, Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa
An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1995, v:53, n:6, pp:359-365 [Journal] - Jung-Heum Park, Hee-Chul Kim
Longest paths and cycles in faulty star graphs. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 2004, v:64, n:11, pp:1286-1296 [Journal] - Jung-Heum Park, Kyung-Yong Chwa
Recursive circulants and their embeddings among hypercubes. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:244, n:1-2, pp:35-62 [Journal] - Jung-Heum Park, Kyung-Yong Chwa
On the Construction of Regular Minimal Broadcast Digraphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:124, n:2, pp:329-342 [Journal] - Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:377, n:1-3, pp:170-180 [Journal] - Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:3, pp:227-240 [Journal]
On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002