Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Nancy E. Clarke"'
Publikováno v:
Graphs and Combinatorics. 37:2439-2457
A variation of the Cops and Robber game is introduced in which the robber side consists of two robbers. The cops win by moving onto the same vertex as one of the robbers after a finite number of moves. As in the original game, the robber side can win
Autor:
Andrea Burgess, Nancy E. Clarke, Rosalind A. Cameron, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike
Publikováno v:
Discrete Applied Mathematics. 285:552-566
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by occupying each
Autor:
Nancy E. Clarke, Danielle Cox, Danny Dyer, Margaret-Ellen Messinger, Shannon L. Fitzpatrick, Christopher Duffy
Publikováno v:
Discrete Applied Mathematics. 282:53-64
We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter l . We consider the basic consequences of this definition for some simple graph families, and show
Autor:
Kira Adaricheva, Heather Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth
The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2c9376c1ed16209dab75f120b07ac0e
Autor:
Kira Adaricheva, Chassidy Bozeman, Margaret-Ellen Messinger, Ruth Haas, Nancy E. Clarke, Karen Seyffarth, Heather C. Smith
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
The dominating graph of a graph G has as its vertices all dominating sets of G, with an edge between two dominating sets if one can be obtained from the other by adding or deleting a single vertex of G. This is an example of a reconfiguration graph.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0c07e3c5c684c7cf6b96ffd9571cbd6
https://doi.org/10.1007/978-3-030-77983-2_6
https://doi.org/10.1007/978-3-030-77983-2_6
Autor:
Fedor V. Fomin, Nancy E. Clarke, Spyros Angelopoulos, Roman Rabinovich, Archontia C. Giannopoulou
Publikováno v:
Theoretical Computer Science. 858:145-146
Autor:
Robert Gallant, Nancy E. Clarke
Publikováno v:
Discrete Mathematics. 340:1705-1715
For a fixed integer t, a set of vertices B of a graph G is a t-limited packing of G provided that the closed neighbourhood of any vertex in G contains at most t elements of B. The size of a largest possible t-limited packing in G is denoted Lt(G) and
Autor:
Margaret-Ellen Messinger, Nancy E. Clarke, Stephen Finbow, Anthony Bonato, F. Mc Inerney, Danielle Cox
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2019, 794, pp.59-68
Theoretical Computer Science, Elsevier, 2019, 794, pp.59-68
Theoretical Computer Science, 2019, 794, pp.59-68
Theoretical Computer Science, Elsevier, 2019, 794, pp.59-68
We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ccb3c04849fa07a9c478699c0f20210
https://inria.hal.science/hal-01627391v2/file/HyperopicCops0826.pdf
https://inria.hal.science/hal-01627391v2/file/HyperopicCops0826.pdf
Publikováno v:
EMNLP/IJCNLP (1)
The need for high-quality, large-scale, goal-oriented dialogue datasets continues to grow as virtual assistants become increasingly wide-spread. However, publicly available datasets useful for this area are limited either in their size, linguistic di
Autor:
Rebecca Milley, Margaret-Ellen Messinger, Shannon J. Fitzpatrick, Stephen Finbow, Richard J. Nowakowski, Nancy E. Clarke
Publikováno v:
Discrete Applied Mathematics. 202:1-7
A proper colouring is referred to as a Grundy colouring, or first-fit colouring if every vertex has a neighbour from each of the colour classes lower than its own. The Grundy number of a graph is the maximum k (number of colours) such that a Grundy c