18 citations · 42 across the 38 of their papers we have counts for
6 papers · 1 filter
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…
Shifting paths to avoidable ones
Vladimir Gurvich, Matjaž Krnc, Martin Milanič +1
An extension of an induced path in a graph is an induced path such that deleting the endpoints of results in . An induced path in a graph is said to be avoidab…
Computational Hardness of Multidimensional Subtraction Games
Vladimir Gurvich, Michael Vyalyi
We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algori…