3 citations · 10 across the 10 of their papers we have counts for
15 papers · 1 filter
More about Exact Slow -Nim
Nikolay Chikin, Vladimir Gurvich, Konstantin Knop +2
Given piles of tokens and a positive integer , the game Nim of exact slow -Nim is played as follows. Two players move alternately. In each move, a play…
Balanced flows for transshipment problems
Vladimir Gurvich
A transshipment problem (G, d, λ) is modeled by a directed graph G = (V, E) with weighted vertices d = (d_v | v \in V) and directed edges λ= (λ_e | e \in E) interpreted as follows:…
Recognizing distributed approval voting forms and correspondences
Endre Boros, Ondrej Cepek, Vladimir Gurvich +1
Each voter has cards that (s)he distributes among the candidates as a measure of approval. One (or several) candidate(s) who received the maximum number o…
Metric and ultrametric inequalities for resistances in directed graphs
Vladimir Gurvich
Consider an electrical circuit each directed edge of which is a semiconductor with a monomial conductance function if and $y…
On the degree sequences of dual graphs on surfaces
Endre Boros, Vladimir Gurvich, Martin Milanič +1
Given two graphs and with a one-to-one correspondence between their edges, when do and form a pair of dual graphs realizing the vertices and countries of a map…
Avoidable Vertices and Edges in Graphs
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich +2
A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \te…