Zobrazeno 1 - 10
of 1 145
pro vyhledávání: '"Suk J"'
Autor:
Devin C. Jean, Suk J. Seo
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 2, p 591 (2024)
Externí odkaz:
https://doaj.org/article/365c2ace663c4caf934bb97ccc27e80b
Autor:
Devin Jean, Suk J. Seo
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 2, p 445 (2023)
Externí odkaz:
https://doaj.org/article/68872961f8c4452cbf4c4bdb5ee1e9d4
Autor:
Arshad M. Khanani, MD, MA, Sunil S. Patel, MD, PhD, Victor H. Gonzalez, MD, Suk J. Moon, MD, Glenn J. Jaffe, MD, John A. Wells, MD, Petra Kozma, MD, PhD, Pravin U. Dugel, MD, Raj K. Maturi, MD
Publikováno v:
Ophthalmology Science, Vol 1, Iss 3, Pp 100040- (2021)
Purpose: To evaluate the safety and preliminary efficacy of THR-687 in patients with center-involved diabetic macular edema (DME). Design: Phase 1, open-label, multicenter, 3 + 3 dose-escalation study with 3-month follow-up. Participants: Patients 18
Externí odkaz:
https://doaj.org/article/2a02a062908b428c989859c995417793
Autor:
Suk J. Seo, Peter J. Slater
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 5, Iss 2, Pp 179-193 (2017)
A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any given "intruder" vertex in V(G). As with many applicat
Externí odkaz:
https://doaj.org/article/381bd6b0638f4e4fad23bc760c03fddf
Autor:
Seo, Suk J., Slater, Peter J.
Publikováno v:
Congressus Numerantium 213 (2012), pp. 155-168
The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimensional array of blocks of seven vertices and nine edges, a planar grap
Externí odkaz:
http://arxiv.org/abs/2202.02620
Autor:
Jean, Devin C., Seo, Suk J.
A detection system, modeled in a graph, is composed of "detectors" positioned at a subset of vertices in order to uniquely locate an ``intruder" at any vertex. \emph{Identifying codes} use detectors that can sense the presence or absence of an intrud
Externí odkaz:
http://arxiv.org/abs/2112.01685
Autor:
JEAN, DEVIN C.1 devin.c.jean@vanderbilt.edu, SEO, SUK J.2 suk.seo@mtsu.edu
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 2, p591-611. 21p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Jean, Devin C., Seo, Suk J.
Publikováno v:
In Discrete Applied Mathematics 15 April 2023 329:106-125
Autor:
Jean, Devin C., Seo, Suk J.
Publikováno v:
In Theoretical Computer Science 25 May 2022 917:94-106