Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Jung-Heum Park"'
Autor:
Jung-Heum Park
Publikováno v:
IEEE Access, Vol 10, Pp 127589-127600 (2022)
One of the key problems in parallel processing is finding disjoint paths in the underlying graph of an interconnection network. The disjoint path cover of a graph is a set of pairwise vertex-disjoint paths that altogether cover every vertex of the gr
Externí odkaz:
https://doaj.org/article/e12c351647954d08952e19201e7384f2
Autor:
Jung Heum Park, Jeong Hwan Wi, Tae Seob Kim, Seung Soo Kim, Cheol Jeong, Jeong Eun Sohn, Robert Kim
Publikováno v:
Applied Sciences, Vol 12, Iss 5, p 2311 (2022)
It is allegedly known that the thermal stability of the Mint Lift® (the Mint Lift® 17 and the Mint Lift® Fine; HansBiomed Co., Ltd., Seoul, Korea) over time might be lower as compared with thread-lifts processed through ultrasonic molding technolo
Externí odkaz:
https://doaj.org/article/c1bc723aedf944bbbe3835df602e04bd
Autor:
Sanghyuk Han, Robert Kim, Tae Seob Kim, Jung Heum Park, Seung Soo Kim, Cheol Jeong, Ji Heui Lee
Publikováno v:
Medicina, Vol 57, Iss 12, p 1370 (2021)
Background and objectives: We conducted this preliminary retrospective study to assess the short-term safety of silicone gel-filled breast implants (SGBIs) that are commercially available in Korean women. Materials and methods :The current retrospect
Externí odkaz:
https://doaj.org/article/ac93c968af6146978d0be91e1cb6ae79
Autor:
Jung-Heum Park
Publikováno v:
International Journal of Foundations of Computer Science. 34:429-441
Given two disjoint vertex-sets, [Formula: see text] and [Formula: see text] in a graph, a paired many-to-many [Formula: see text]-disjoint path cover joining [Formula: see text] and [Formula: see text] is a set of pairwise vertex-disjoint paths [Form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6be4b482774feef1e729d2682ddf8e26
https://doi.org/10.1142/s0129054122500241
https://doi.org/10.1142/s0129054122500241
Autor:
Jung-Heum Park, Hyeong-Seok Lim
Publikováno v:
The Journal of Supercomputing. 79:2783-2800
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50c7a4c188b3b1dcbdf54479079edaf1
https://doi.org/10.1007/s11227-022-04768-x
https://doi.org/10.1007/s11227-022-04768-x
Autor:
Sanghyuk Han, Cheol Jeong, Seung Hwan Hwang, Tae Seob Kim, Jung Heum Park, Seung Soo Kim, Ji Heui Lee, Yu Kwan Song, Robert Kim
Publikováno v:
Plastic & Reconstructive Surgery.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20227dbebc32fec96fcddf1d17a94789
https://doi.org/10.1097/prs.0000000000010351
https://doi.org/10.1097/prs.0000000000010351
Autor:
Won Seok Shim, Kyung Hi Choi, Cheol Jeong, Seung Soo Kim, Tae In Lee, Yu Kwan Song, Jung Heum Park, Tae Seob Kim
Publikováno v:
The American Journal of Cosmetic Surgery. 38:163-170
We conducted this study to assess the short-term treatment outcomes and safety of facial rejuvenation with the YVOIRE volume plus (LG Chem Ltd., Seoul) in Asian women. In this multicenter, retrospective study, we evaluated a total of 291 women (n = 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d997041ffddf28607ed8bc249966b891
https://doi.org/10.1177/0748806821991422
https://doi.org/10.1177/0748806821991422
Autor:
Jung-Heum Park
Publikováno v:
The Journal of Supercomputing. 77:6871-6888
Given disjoint source and sink sets, $$S = \{ s_1,\ldots ,s_k\}$$ and $$T = \{t_1,\ldots , t_k\}$$ , in a graph G, an unpaired k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths $$\{ P_1, \ldots , P_k\}$$ that altogether
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32d57f111a5ae72ec759ba2ead0e82db
https://doi.org/10.1007/s11227-020-03512-7
https://doi.org/10.1007/s11227-020-03512-7
Autor:
Jung-Heum Park
Publikováno v:
Discrete Applied Mathematics. 289:64-77
Given two disjoint vertex-sets, S = { s 1 , … , s k } and T = { t 1 , … , t k } in a graph, a paired many-to-many k -disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths { P 1 , … , P k } that altogether cover every ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de7498cdbbbb894ebbc50bccc187bafd
https://doi.org/10.1016/j.dam.2020.09.008
https://doi.org/10.1016/j.dam.2020.09.008
Autor:
Jung-Heum Park, Hyeong-Seok Lim
Publikováno v:
Theoretical Computer Science. 821:71-86
Given disjoint source and sink sets, S = { s 1 , … , s k } and T = { t 1 , … , t k } , in a graph G, an unpaired k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths { P 1 , … , P k } that altogether cover every vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9def2eada227e906b98268e60e8a1a32
https://doi.org/10.1016/j.tcs.2020.03.010
https://doi.org/10.1016/j.tcs.2020.03.010