default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJung-Heum Park
- > Home > Persons > Jung-Heum Park
Publications
- 2019
[j33]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: 104-115 (2019)- 2017
- [j29]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: 246-269 (2017) - 2016
- [j27]Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park:
Ore-type degree conditions for disjoint path covers in simple graphs. Discret. Math. 339(2): 770-779 (2016) - 2015
- [j23]Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim:
The bicube: an interconnection of two hypercubes. Int. J. Comput. Math. 92(1): 29-40 (2015) - 2014
- [j20]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: 98-116 (2014) - 2009
- [j11]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): 528-540 (2009) - 2008
- [c11]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: 1-8 - 2007
- [j8]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): 170-180 (2007) - 2006
- [j7]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): 227-240 (2006) - [c10]Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim:
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements. ISPA Workshops 2006: 291-300 - [c9]Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim:
Embedding Starlike Trees into Hypercube-Like Interconnection Networks. ISPA Workshops 2006: 301-310 - 2005
- [c8]Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim:
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. IPDPS 2005 - 2004
- [j6]Jung-Heum Park, Hee-Chul Kim:
Longest paths and cycles in faulty star graphs. J. Parallel Distributed Comput. 64(11): 1286-1296 (2004) - [c6]Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim:
Fault Hamiltonicity of Meshes with Two Wraparound Edges. COCOON 2004: 412-421 - [c5]Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim:
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements. ISAAC 2004: 742-753 - 2003
- [c4]Jung-Heum Park, Hee-Chul Kim:
Fault-Hamiltonicity of Product Graph of Path and Cycle. COCOON 2003: 319-328 - 1999
- [c3]Jung-Heum Park, Hee-Chul Kim:
Dihamiltonian Decomposition of Regular Graphs with Degree Three. WG 1999: 240-249
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
