Zobrazeno 1 - 10 of 70 pro vyhledávání: '"Eunjeong Yi"'
1
Akademický článek
SGMiner: A Fast and Scalable GPU-Based Frequent Pattern Miner on SSDs
Autor: Kang-Wook Chon, Eunjeong Yi, Min-Soo Kim
Publikováno v: IEEE Access, Vol 10, Pp 62502-62519 (2022)
Frequent itemset mining is extensively employed as an essential data mining technique. Nevertheless, as the data size grows, the applicability of this method decreases owing to the relatively poor performance of the existing methods. Though numerous
Externí odkaz: https://doaj.org/article/01c59487e09b439d82ab3608268d5a0e
Zobrazit plný text záznamu
2
Akademický článek
On the super domination number of graphs
Autor: Douglas J. Klein, Juan A. Rodrıguez-Velazquez, Eunjeong Yi
Publikováno v: Communications in Combinatorics and Optimization, Vol 5, Iss 2, Pp 83-96 (2020)
The open neighborhood of a vertex v of a graph G is the set N(v) consisting of all vertices adjacent to v in G. For D ⊆ V (G), we define D = V (G) \ D. A set D ⊆ V (G) is called a super dominating set of G if for every vertex u ∈ D, there exi
Externí odkaz: https://doaj.org/article/4bfd278b636c48eca3abc9a4ec856388
Zobrazit plný text záznamu
9
Maker–Breaker Resolving Game
Autor: Sandi Klavžar, Ismael G. Yero, Cong X. Kang, Eunjeong Yi
Publikováno v: Bulletin of the Malaysian Mathematical Sciences Society. 44:2081-2099
A set of vertices W of a graph G is a resolving set if every vertex of G is uniquely determined by its vector of distances to W. In this paper, the Maker–Breaker resolving game is introduced. The game is played on a graph G by Resolver and Spoiler
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9018e4d7102c0a136e11516dbe90cf1d
https://doi.org/10.1007/s40840-020-01044-0
Zobrazit plný text záznamu
10
On the broadcast domination number of permutation graphs
Autor: Eunjeong Yi
Publikováno v: Theoretical Computer Science. 806:171-183
Broadcast domination models the idea of covering a network of cities by transmitters of varying powers while minimizing the total cost of the transmitters used to achieve full coverage. To be exact, let G be a connected graph of order at least two wi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cc464381b555e8d1014d6d0b25fa2233
https://doi.org/10.1016/j.tcs.2019.03.025
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje