Zobrazeno 1 - 10
of 2 829
pro vyhledávání: '"Kim Eun Jung"'
We show that given a graph G we can CMSO-transduce its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who gave such transductions using orde
Externí odkaz:
http://arxiv.org/abs/2412.04970
Given a graph $G$ and an integer $b$, Bandwidth asks whether there exists a bijection $\pi$ from $V(G)$ to $\{1, \ldots, |V(G)|\}$ such that $\max_{\{u, v \} \in E(G)} | \pi(u) - \pi(v) | \leq b$. This is a classical NP-complete problem, known to rem
Externí odkaz:
http://arxiv.org/abs/2309.17204
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Discrete Algorithms (August 20, 2024) dmtcs:10810
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies $I'\in I$, a
Externí odkaz:
http://arxiv.org/abs/2301.03221
Autor:
Kim, Eun Jung1,2, Park, Kwan Kyu3, Choi, Su Youn4, Ju, Hyang Mi4, Kim, Tae Lim4, Kim, Jeongmin1,2, Kim, Soo Yeon1, Koo, Bon-Nyeo1,2 KOOBN@yuhs.ac
Publikováno v:
BMC Anesthesiology. 11/15/2024, Vol. 24 Issue 1, p1-8. 8p.
Publikováno v:
SIAM Journal on Discrete Mathematics 38(1), 170-189, 2024
One of the first application of the recently introduced technique of \emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark problem in parameterize
Externí odkaz:
http://arxiv.org/abs/2208.14841
We study the parameterized problem of satisfying ``almost all'' constraints of a given formula $F$ over a fixed, finite Boolean constraint language $\Gamma$, with or without weights. More precisely, for each finite Boolean constraint language $\Gamma
Externí odkaz:
http://arxiv.org/abs/2207.07422
The recently introduced graph parameter tree-cut width plays a similar role with respect to immersions as the graph parameter treewidth plays with respect to minors. In this paper, we provide the first algorithmic applications of tree-cut width to ha
Externí odkaz:
http://arxiv.org/abs/2206.00752
Autor:
Bonnet, Édouard, Chakraborty, Dibyayan, Kim, Eun Jung, Köhler, Noleen, Lopes, Raul, Thomassé, Stéphan
We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$ is monadic
Externí odkaz:
http://arxiv.org/abs/2204.00722
Autor:
Goo, Bonhyuk, Kim, Jung-Hyun, Kim, Eun-Jung, Nam, Dongwoo, Lee, Hyun-Jong, Kim, Jae-Soo, Park, Yeon-Cheol, Baek, Yong-Hyeon, Nam, Sang-Soo, Seo, Byung-Kwan
Publikováno v:
In Integrative Medicine Research December 2024 13(4)
Autor:
Mahmud, Farabi, Kim, Sungkeun, Chawla, Harpreet Singh, Tsai, Chia-Che, Kim, Eun Jung, Muzahid, Abdullah
Publikováno v:
Annual Computer Security Applications Conference ACSAC 2023
For a distributed last-level cache (LLC) in a large multicore chip, the access time to one LLC bank can significantly differ from that to another due to the difference in physical distance. In this paper, we successfully demonstrated a new distance-b
Externí odkaz:
http://arxiv.org/abs/2112.10028