Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Komarov, Natasha"'
Autor:
Khatri, Devvrit, Komarov, Natasha, Krim-Yee, Aaron, Kumar, Nithish, Seamone, Ben, Virgile, Virgélot, Xu, AnQi
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between the cop numbers of an oriented graph and its underlying undirected gra
Externí odkaz:
http://arxiv.org/abs/1811.06155
Autor:
Komarov, Natasha, Mackey, John
We find an exact formula for the number of directed 5-cycles in a tournament in terms of its edge score sequence. We use this formula to find both upper and lower bounds on the number of 5-cycles in any $n$-tournament. In particular, we show that the
Externí odkaz:
http://arxiv.org/abs/1410.6828
We consider "Containment": a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop), and the cops win by
Externí odkaz:
http://arxiv.org/abs/1405.3330
Autor:
Komarov, Natasha, Winkler, Peter
We consider a variation of a cops and robbers game in which the cop---here referred to as "hunter"---is not constrained by the graph but must play in the dark against a "mole." We characterize the graphs---which we will call "hunter-win"---on which t
Externí odkaz:
http://arxiv.org/abs/1311.0211
Autor:
Komarov, Natasha, Winkler, Peter
We consider a variation of cop vs.\ robber on graph in which the robber is not restricted by the graph edges; instead, he picks a time-independent probability distribution on $V(G)$ and moves according to this fixed distribution. The cop moves from v
Externí odkaz:
http://arxiv.org/abs/1308.4715
Autor:
Komarov, Natasha, Winkler, Peter
Publikováno v:
Electronic Journal of Combinatorics, Volume 21 (3), 2014
We show that the expected time for a smart "cop" to catch a drunk "robber" on an $n$-vertex graph is at most $n + {\rm o}(n)$. More precisely, let $G$ be a simple, connected, undirected graph with distinguished points $u$ and $v$ among its $n$ vertic
Externí odkaz:
http://arxiv.org/abs/1305.4559
Autor:
Crytser, Danny1 (AUTHOR), Komarov, Natasha1 (AUTHOR) nkomarov@stlawu.edu, Mackey, John2 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. May2020, Vol. 36 Issue 3, p591-605. 15p.
Autor:
Komarov, Natasha1 nkomarov@stlawu.edu, Mackey, John2 jmackey@andrew.cmu.edu
Publikováno v:
Journal of Graph Theory. Nov2017, Vol. 86 Issue 3, p341-356. 16p.
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.
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.