Zobrazeno 1 - 6
of 6
pro vyhledávání: '"William Klostermeyer"'
Publikováno v:
Transactions on Combinatorics, Vol 4, Iss 4, Pp 15-31 (2015)
We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other gu
Externí odkaz:
https://doaj.org/article/5559404b7b8d4e8ca6eb770447ef4802
Publikováno v:
Theory and Applications of Graphs, Vol 4, Iss 1 (2017)
A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur at vertices with mobile guards; the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Oth
Externí odkaz:
https://doaj.org/article/427d02c651f54e8595b476d604192a63
Autor:
Yair Caro, William Klostermeyer
Publikováno v:
Theory and Applications of Graphs, Vol 3, Iss 1 (2016)
The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection. In this paper, eternal independent sets are introduc
Externí odkaz:
https://doaj.org/article/e03cb088238941c6a0a2d80a7c74b9a8
Autor:
Conrad Testagrose, Vikash Gupta, Barbaros S. Erdal, Richard D. White, Robert W. Maxwell, Xudong Liu, Indika Kahanda, Sherif Elfayoumy, William Klostermeyer, Mutlu Demirer
Publikováno v:
2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26e5e79ed6a817694b7e179836f523a8
https://doi.org/10.1109/bibm55620.2022.9995206
https://doi.org/10.1109/bibm55620.2022.9995206
Autor:
William Klostermeyer, Cun Quan Zhang
Publikováno v:
Journal of Graph Theory. 33:109-119
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::995fe1e44e0eb6ad18043d7cdba353ea
https://doi.org/10.1002/(sici)1097-0118(200002)33:2<109::aid-jgt5>3.0.co
https://doi.org/10.1002/(sici)1097-0118(200002)33:2<109::aid-jgt5>3.0.co
Publikováno v:
Information Processing Letters. 38:307-313
We consider the wait-for graphs that are edge-disjoint reducible. We show that the problem of finding minimum abort set is polynomial-time solvable for such wait-for graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9347bad0318a3aed3a2f84b1dea7894
https://doi.org/10.1016/0020-0190(91)90087-x
https://doi.org/10.1016/0020-0190(91)90087-x