Jung-Heum Park

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 18

Top Topics

Connected Graphs

Graph Theoretic

Selecting A Small Number

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

J. Comput. Syst. Sci.

Inf. Process. Lett.

Publications

Jung-Heum Park
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. Int. J. Found. Comput. Sci. 34 (4) (2023)
Jung-Heum Park, Hyeong-Seok Lim
Characterization of interval graphs that are paired 2-disjoint path coverable. J. Supercomput. 79 (3) (2023)
Jung-Heum Park
Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements. IEEE Access 10 (2022)
Jung-Heum Park
Torus-like graphs and their paired many-to-many disjoint path covers. Discret. Appl. Math. 289 (2021)
Jung-Heum Park
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs. J. Supercomput. 77 (7) (2021)
Jung-Heum Park, Hyeong-Seok Lim
Characterization of interval graphs that are unpaired 2-disjoint path coverable. Theor. Comput. Sci. 821 (2020)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. J. Comput. Syst. Sci. 105 (2019)
Jung-Heum Park, Insung Ihm
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Inf. Process. Lett. 142 (2019)
Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim
Disjoint path covers joining prescribed source and sink sets in interval graphs. Theor. Comput. Sci. 776 (2019)
Jung-Heum Park
Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids. J. Comput. Sci. Eng. 12 (3) (2018)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Disjoint path covers with path length constraints in restricted hypercube-like graphs. J. Comput. Syst. Sci. 89 (2017)
Insung Ihm, Jung-Heum Park
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. Discret. Appl. Math. 218 (2017)
Jung-Heum Park
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs. Theor. Comput. Sci. 617 (2016)
Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park
Ore-type degree conditions for disjoint path covers in simple graphs. Discret. Math. 339 (2) (2016)
Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim
Algorithms for finding disjoint path covers in unit interval graphs. Discret. Appl. Math. 205 (2016)
Jung-Heum Park
Paired many-to-many disjoint path covers in restricted hypercube-like graphs. Theor. Comput. Sci. 634 (2016)
Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
The bicube: an interconnection of two hypercubes. Int. J. Comput. Math. 92 (1) (2015)
Jung-Heum Park, Insung Ihm
Many-to-many two-disjoint path covers in cylindrical and toroidal grids. Discret. Appl. Math. 185 (2015)
Sook-Yeon Kim, Jung-Heum Park
Many-to-many two-disjoint path covers in restricted hypercube-like graphs. Theor. Comput. Sci. 531 (2014)
Jung-Heum Park, Insung Ihm
Disjoint path covers in cubes of connected graphs. Discret. Math. 325 (2014)
Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks. Theor. Comput. Sci. 548 (2014)
Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs. Inf. Sci. 242 (2013)
Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa
Paired many-to-many disjoint path covers in faulty hypercubes. Theor. Comput. Sci. 513 (2013)
Jung-Heum Park, Insung Ihm
Strong matching preclusion under the conditional fault model. Discret. Appl. Math. 161 (7-8) (2013)
Sook-Yeon Kim, Jung-Heum Park
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m, 4))$. IEEE Trans. Computers 62 (12) (2013)
Jung-Heum Park, Insung Ihm
Single-source three-disjoint path covers in cubes of connected graphs. Inf. Process. Lett. 113 (14-16) (2013)
Jae-Ha Lee, Jung-Heum Park
General-demand disjoint path covers in a graph with faulty elements. Int. J. Comput. Math. 89 (5) (2012)
Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park
, 4) with faulty elements. Theor. Comput. Sci. 412 (35) (2011)
Jung-Heum Park, Insung Ihm
Strong matching preclusion. Theor. Comput. Sci. 412 (45) (2011)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements. IEEE Trans. Computers 58 (4) (2009)
Jung-Heum Park, Sang Hyuk Son
Conditional matching preclusion for hypercube-like interconnection networks. Theor. Comput. Sci. 410 (27-29) (2009)
Jung-Heum Park
, 4). Theor. Comput. Sci. 390 (1) (2008)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IPDPS (2008)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. Theor. Comput. Sci. 377 (1-3) (2007)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements. ISPA Workshops (2006)
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. ISPA Workshops (2006)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements. IEEE Trans. Parallel Distributed Syst. 17 (3) (2006)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. IPDPS (2005)
Jung-Heum Park, Hee-Chul Kim
Longest paths and cycles in faulty star graphs. J. Parallel Distributed Comput. 64 (11) (2004)
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements. ISAAC (2004)
Jung-Heum Park
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements. COCOON (2004)
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
Fault Hamiltonicity of Meshes with Two Wraparound Edges. COCOON (2004)
Jung-Heum Park, Hee-Chul Kim
Fault-Hamiltonicity of Product Graph of Path and Cycle. COCOON (2003)
Jung-Heum Park, Kyung-Yong Chwa
Recursive circulants and their embeddings among hypercubes. Theor. Comput. Sci. 244 (1-2) (2000)
Jung-Heum Park, Hee-Chul Kim
Dihamiltonian Decomposition of Regular Graphs with Degree Three. WG (1999)
Jung-Heum Park
Hamiltonian Decomposition of Recursive Circulants. ISAAC (1998)
Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa
Embedding Trees in Recursive Circulants. Discret. Appl. Math. 69 (1-2) (1996)
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. Inf. Process. Lett. 53 (6) (1995)
Jung-Heum Park, Kyung-Yong Chwa
On the Construction of Regular Minimal Broadcast Digraphs. Theor. Comput. Sci. 124 (2) (1994)
Jung-Heum Park, Kyung-Yong Chwa
Recursive circulant: a new topology for multicomputer networks (extended abstract). ISPAN (1994)
Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, Tony C. Woo
On the Number of Guard Edges of a Polygon. Discret. Comput. Geom. 10 (1993)