Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Calum MacRury"'
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:1274-1290
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8e53dbf5f8fb9f14187c4a283e3e5f0
https://doi.org/10.1137/21m1446939
https://doi.org/10.1137/21m1446939
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8c5fefad6bb55eaf0b50b227452295a
https://doi.org/10.1137/1.9781611977554.ch76
https://doi.org/10.1137/1.9781611977554.ch76
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12aa51ec5e7b4b2f2c2558e8428ea6e3
https://doi.org/10.1007/s00453-022-01075-y
https://doi.org/10.1007/s00453-022-01075-y
Publikováno v:
Journal of Combinatorics. 12:85-116
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6aee7e51263f204dccee464bc84694a1
https://doi.org/10.4310/joc.2021.v12.n1.a4
https://doi.org/10.4310/joc.2021.v12.n1.a4
Publikováno v:
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN
LATIN
We study p-Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or 1-ray) for a hidden item. The searcher is probabilistically faulty, and detection of the item with each visitation i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60fba9eca8f467c589b789378c11690a
https://doi.org/10.1007/978-3-030-61792-9_14
https://doi.org/10.1007/978-3-030-61792-9_14
Publikováno v:
European Journal of Combinatorics. 99:103423
The semi-random graph process is a single player game in which the player is initially presented an empty graph on n vertices. In each round, a vertex u is presented to the player independently and uniformly at random. The player then adaptively sele
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88dfca7411905aa5dc6a0e7aaed5f221
https://doi.org/10.1016/j.ejc.2021.103423
https://doi.org/10.1016/j.ejc.2021.103423
Autor:
Anthony Bonato, Rita María del Río-Chanona, Xavier Pérez-Giménez, Paweł Prałat, Kirill Ternovsky, Jake Nicolaidis, Calum MacRury
Publikováno v:
Discrete Applied Mathematics. 247:23-36
Information gathering by crawlers on the web is of practical interest. We consider a simplified model for crawling complex networks such as the web graph, which is a variation of the robot vacuum edge-cleaning process of Messinger and Nowakowski. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bddc0bc86a7b0c1049516b15ebae4d0d
https://doi.org/10.1016/j.dam.2018.01.018
https://doi.org/10.1016/j.dam.2018.01.018
We consider the localization game played on graphs in which a cop tries to determine the exact location of an invisible robber by exploiting distance probes. The corresponding graph parameter $\zeta(G)$ for a given graph $G$ is called the localizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87509bd43a94822c9cf23ecda6257f6a
http://arxiv.org/abs/1910.11225
http://arxiv.org/abs/1910.11225
Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white neighbor force these white vertices to become blue. Here we study prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::543a5e41d6626fd5cf74c986f8f50700
http://arxiv.org/abs/1909.06568
http://arxiv.org/abs/1909.06568
Publikováno v:
The Electronic Journal of Combinatorics. 25
We study the distribution of coefficients of rank polynomials of random sparse graphs. We first discuss the limiting distribution for general graph sequences that converge in the sense of Benjamini-Schramm. Then we compute the limiting distribution a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::069158cc542cabdeed20fcf70b95b469
https://doi.org/10.37236/7133
https://doi.org/10.37236/7133