Jung-Heum Park

According to our database, Jung-Heum Park authored at least 50 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults.

Jung-Heum Park

Int. J. Found. Comput. Sci., June, 2023

Characterization of interval graphs that are paired 2-disjoint path coverable.

Jung-Heum Park, Hyeong-Seok Lim

J. Supercomput., 2023

2022

Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements.

Jung-Heum Park

IEEE Access, 2022

2021

A sufficient condition for the unpaired k-disjoint path coverability of interval graphs.

Jung-Heum Park

J. Supercomput., 2021

Torus-like graphs and their paired many-to-many disjoint path covers.

Jung-Heum Park

Discret. Appl. Math., 2021

2020

Characterization of interval graphs that are unpaired 2-disjoint path coverable.

Jung-Heum Park, Hyeong-Seok Lim

Theor. Comput. Sci., 2020

2019

Disjoint path covers joining prescribed source and sink sets in interval graphs.

Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim

Theor. Comput. Sci., 2019

Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs.

Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim

J. Comput. Syst. Sci., 2019

A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph.

Jung-Heum Park, Insung Ihm

Inf. Process. Lett., 2019

2018

Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids.

Jung-Heum Park

J. Comput. Sci. Eng., 2018

2017

Disjoint path covers with path length constraints in restricted hypercube-like graphs.

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

J. Comput. Syst. Sci., 2017

A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph.

Insung Ihm, Jung-Heum Park

Discret. Appl. Math., 2017

2016

Paired many-to-many disjoint path covers in restricted hypercube-like graphs.

Jung-Heum Park

Theor. Comput. Sci., 2016

Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs.

Jung-Heum Park

Theor. Comput. Sci., 2016

Ore-type degree conditions for disjoint path covers in simple graphs.

Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park

Discret. Math., 2016

Algorithms for finding disjoint path covers in unit interval graphs.

Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim

Discret. Appl. Math., 2016

2015

The bicube: an interconnection of two hypercubes.

Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim

Int. J. Comput. Math., 2015

Many-to-many two-disjoint path covers in cylindrical and toroidal grids.

Jung-Heum Park, Insung Ihm

Discret. Appl. Math., 2015

2014

Many-to-many two-disjoint path covers in restricted hypercube-like graphs.

Sook-Yeon Kim, Jung-Heum Park

Theor. Comput. Sci., 2014

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

Theor. Comput. Sci., 2014

Disjoint path covers in cubes of connected graphs.

Jung-Heum Park, Insung Ihm

Discret. Math., 2014

2013

Paired many-to-many disjoint path covers in faulty hypercubes.

Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa

Theor. Comput. Sci., 2013

Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m, 4))$.

Sook-Yeon Kim, Jung-Heum Park

IEEE Trans. Computers, 2013

Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs.

Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa

Inf. Sci., 2013

Single-source three-disjoint path covers in cubes of connected graphs.

Jung-Heum Park, Insung Ihm

Inf. Process. Lett., 2013

Strong matching preclusion under the conditional fault model.

Jung-Heum Park, Insung Ihm

Discret. Appl. Math., 2013

2012

General-demand disjoint path covers in a graph with faulty elements.

Jae-Ha Lee, Jung-Heum Park

Int. J. Comput. Math., 2012

2011

Strong matching preclusion.

Jung-Heum Park, Insung Ihm

Theor. Comput. Sci., 2011

Disjoint path covers in recursive circulants G(2^m, 4) with faulty elements.

Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park

Theor. Comput. Sci., 2011

2009

Conditional matching preclusion for hypercube-like interconnection networks.

Jung-Heum Park, Sang Hyuk Son

Theor. Comput. Sci., 2009

Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements.

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

IEEE Trans. Computers, 2009

2008

Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2^m, 4).

Jung-Heum Park

Theor. Comput. Sci., 2008

On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements.

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2007

Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements.

Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim

Theor. Comput. Sci., 2007

2006

Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements.

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

IEEE Trans. Parallel Distributed Syst., 2006

Embedding Starlike Trees into Hypercube-Like Interconnection Networks.

Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim

Proceedings of the Frontiers of High Performance Computing and Networking, 2006

2005

Fault-Hamiltonicity of Hypercube-Like Interconnection Networks.

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004

Longest paths and cycles in faulty star graphs.

Jung-Heum Park, Hee-Chul Kim

J. Parallel Distributed Comput., 2004

Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.

Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Fault Hamiltonicity of Meshes with Two Wraparound Edges.

Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.

Jung-Heum Park

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Fault-Hamiltonicity of Product Graph of Path and Cycle.

Jung-Heum Park, Hee-Chul Kim

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2000

Recursive circulants and their embeddings among hypercubes.

Jung-Heum Park, Kyung-Yong Chwa

Theor. Comput. Sci., 2000

1999

Dihamiltonian Decomposition of Regular Graphs with Degree Three.

Jung-Heum Park, Hee-Chul Kim

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

Hamiltonian Decomposition of Recursive Circulants.

Jung-Heum Park

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1996

Embedding Trees in Recursive Circulants.

Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa

Discret. Appl. Math., 1996

1995

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

Inf. Process. Lett., 1995

1994

On the Construction of Regular Minimal Broadcast Digraphs.

Jung-Heum Park, Kyung-Yong Chwa

Theor. Comput. Sci., 1994

Recursive circulant: a new topology for multicomputer networks (extended abstract).

Jung-Heum Park, Kyung-Yong Chwa

Proceedings of the International Symposium on Parallel Architectures, 1994

1993

On the Number of Guard Edges of a Polygon.

Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, Tony C. Woo

Discret. Comput. Geom., 1993