Jung-Heum Park

53 papers A 2B 3Misc 3Journal 42Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
On Paired 2-Disjoint Path Coverability of Johnson and Generalized Johnson Graphs.
IEEE Access
Jung-Heum Park
2025 J jnl
Unpaired disjoint path covers in bipartite torus-like graphs with edge faults.
J. Supercomput.
Jung-Heum Park
2023 J jnl
Characterization of interval graphs that are paired 2-disjoint path coverable.
J. Supercomput.
Jung-Heum Park, Hyeong-Seok Lim
2023 J jnl
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults.
Int. J. Found. Comput. Sci.
Jung-Heum Park
2022 J jnl
Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements.
IEEE Access
Jung-Heum Park
2021 J jnl
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs.
J. Supercomput.
Jung-Heum Park
2021 J jnl
Torus-like graphs and their paired many-to-many disjoint path covers.
Discret. Appl. Math.
Jung-Heum Park
2020 J jnl
Characterization of interval graphs that are unpaired 2-disjoint path coverable.
Theor. Comput. Sci.
Jung-Heum Park, Hyeong-Seok Lim
2019 J jnl
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph.
Inf. Process. Lett.
Jung-Heum Park, Insung Ihm
2019 J jnl
Disjoint path covers joining prescribed source and sink sets in interval graphs.
Theor. Comput. Sci.
Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim
2019 J jnl
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs.
J. Comput. Syst. Sci.
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
2018 J jnl
Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids.
J. Comput. Sci. Eng.
Jung-Heum Park
2017 J jnl
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph.
Discret. Appl. Math.
Insung Ihm, Jung-Heum Park
2017 J jnl
Disjoint path covers with path length constraints in restricted hypercube-like graphs.
J. Comput. Syst. Sci.
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2016 J jnl
Algorithms for finding disjoint path covers in unit interval graphs.
Discret. Appl. Math.
Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim
2016 J jnl
Ore-type degree conditions for disjoint path covers in simple graphs.
Discret. Math.
Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park
2016 J jnl
Paired many-to-many disjoint path covers in restricted hypercube-like graphs.
Theor. Comput. Sci.
Jung-Heum Park
2016 J jnl
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs.
Theor. Comput. Sci.
Jung-Heum Park
2015 J jnl
Many-to-many two-disjoint path covers in cylindrical and toroidal grids.
Discret. Appl. Math.
Jung-Heum Park, Insung Ihm
2015 J jnl
The bicube: an interconnection of two hypercubes.
Int. J. Comput. Math.
Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
2014 J jnl
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks.
Theor. Comput. Sci.
Hee-Chul Kim, Hyeong-Seok Lim, Jung-Heum Park
2014 J jnl
Disjoint path covers in cubes of connected graphs.
Discret. Math.
Jung-Heum Park, Insung Ihm
2014 J jnl
Many-to-many two-disjoint path covers in restricted hypercube-like graphs.
Theor. Comput. Sci.
Sook-Yeon Kim, Jung-Heum Park
2013 J jnl
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs.
Inf. Sci.
Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa
2013 J jnl
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m, 4))$.
IEEE Trans. Computers
Sook-Yeon Kim, Jung-Heum Park
2013 J jnl
Paired many-to-many disjoint path covers in faulty hypercubes.
Theor. Comput. Sci.
Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa
2013 J jnl
Single-source three-disjoint path covers in cubes of connected graphs.
Inf. Process. Lett.
Jung-Heum Park, Insung Ihm
2013 J jnl
Strong matching preclusion under the conditional fault model.
Discret. Appl. Math.
Jung-Heum Park, Insung Ihm
2012 J jnl
General-demand disjoint path covers in a graph with faulty elements.
Int. J. Comput. Math.
Jae-Ha Lee, Jung-Heum Park
2011 J jnl
Disjoint path covers in recursive circulants G(2
Theor. Comput. Sci.
Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park
2011 J jnl
Strong matching preclusion.
Theor. Comput. Sci.
Jung-Heum Park, Insung Ihm
2009 J jnl
Conditional matching preclusion for hypercube-like interconnection networks.
Theor. Comput. Sci.
Jung-Heum Park, Sang Hyuk Son
2009 J jnl
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements.
IEEE Trans. Computers
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2008 A conf
On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements.
IPDPS
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2008 J jnl
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2
Theor. Comput. Sci.
Jung-Heum Park
2007 J jnl
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements.
Theor. Comput. Sci.
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
2006 — conf
Embedding Starlike Trees into Hypercube-Like Interconnection Networks.
ISPA Workshops
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
2006 J jnl
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements.
IEEE Trans. Parallel Distributed Syst.
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2006 — conf
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements.
ISPA Workshops
Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim
2005 A conf
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.
IPDPS
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2004 Misc conf
Fault Hamiltonicity of Meshes with Two Wraparound Edges.
COCOON
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim
2004 J jnl
Longest paths and cycles in faulty star graphs.
J. Parallel Distributed Comput.
Jung-Heum Park, Hee-Chul Kim
2004 B conf
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.
ISAAC
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
2004 Misc conf
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.
COCOON
Jung-Heum Park
2003 Misc conf
Fault-Hamiltonicity of Product Graph of Path and Cycle.
COCOON
Jung-Heum Park, Hee-Chul Kim
2000 J jnl
Recursive circulants and their embeddings among hypercubes.
Theor. Comput. Sci.
Jung-Heum Park, Kyung-Yong Chwa
1999 B conf
Dihamiltonian Decomposition of Regular Graphs with Degree Three.
WG
Jung-Heum Park, Hee-Chul Kim
1998 B conf
Hamiltonian Decomposition of Recursive Circulants.
ISAAC
Jung-Heum Park
1996 J jnl
Embedding Trees in Recursive Circulants.
Discret. Appl. Math.
Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa
1995 J jnl
An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility.
Inf. Process. Lett.
Sung-Ho Kim, Jung-Heum Park, Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa
1994 J jnl
On the Construction of Regular Minimal Broadcast Digraphs.
Theor. Comput. Sci.
Jung-Heum Park, Kyung-Yong Chwa
1994 — conf
Recursive circulant: a new topology for multicomputer networks (extended abstract).
ISPAN
Jung-Heum Park, Kyung-Yong Chwa
1993 J jnl
On the Number of Guard Edges of a Polygon.
Discret. Comput. Geom.
Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, Tony C. Woo