Zobrazeno 1 - 10
of 178
pro vyhledávání: '"Srivastav, Anand"'
Autor:
Geest, Jan, Srivastav, Anand
An extension of the Erd\H{o}s-Renyi random graph model $G_{n,p}$ is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a special case of the model of randomly augmented graphs studied in this
Externí odkaz:
http://arxiv.org/abs/2406.14223
We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b \in \mathbb{N}$ where the goal of Maker is to build a copy of a specific fixed subgraph $H$. In our work this is a spanning graph
Externí odkaz:
http://arxiv.org/abs/2406.11051
Autor:
Sowa, Matthias, Srivastav, Anand
Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \in \mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each round of t
Externí odkaz:
http://arxiv.org/abs/2405.04462
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of all, we stat
Externí odkaz:
http://arxiv.org/abs/2106.05136
Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$ such
Externí odkaz:
http://arxiv.org/abs/2101.09080
Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$ such
Externí odkaz:
http://arxiv.org/abs/2003.06936
Autor:
Glazik, Christian, Srivastav, Anand
The triangle game introduced by Chv\'{a}tal and Erd\H{o}s (1978) is one of the most famous combinatorial games. For $n,q\in\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph $K_n$. Alterna
Externí odkaz:
http://arxiv.org/abs/1812.01382
Autor:
Glazik, Christian, Srivastav, Anand
Publikováno v:
In European Journal of Combinatorics August 2022 104
We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. Our main result is the first one pass W-Streaming algorithm computing a
Externí odkaz:
http://arxiv.org/abs/1710.04091
Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries to break the secret code by making as few guesses as possible, exploit
Externí odkaz:
http://arxiv.org/abs/1611.05907