Add to ORKGIn the graph distance game, two players alternate in constructing a maximal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to minimize. In this paper we examine the distance game for various graph operations: the join, the corona and the lexicographic product of graphs. We provide general bounds and exact results for special graphsPeer Reviewe
We propose the study of many new variants of two-person graph labeling games. Hardly anything has be...
Part 1: Track A: Algorithms, Complexity and Models of ComputationInternational audienceIn this work ...
Let G = (V,E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of...
In the graph distance game, two players alternate in constructing a max- imal path. The objective fu...
In the graph distance game, two players alternate in constructing a maximal path. The objective func...
Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then ...
The thesis is devoted to the study of graph and hypergraph games, which are cooperative games with c...
In this paper we study a generalization of the classic network creation game in the scenario in whic...
In this paper we study a generalization of the classic \emph{network creation game} to the scenario ...
In this work we address a game theoretic variant of the shortest path problem, in which two decision...
Inspired by Lelek's idea from [Disjoint mappings and the span of spaces,Fund. Math. 55 (1964), 199 -...
International audienceWe define and study the following two-player game on a graph G. Let k ∈ N *. A...
A \emph{network creation game} simulates a decentralized and non-cooperative building of a communica...
Let G = (V, E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of S is...
We propose the study of many new variants of two-person graph labeling games. Hardly anything has be...
Part 1: Track A: Algorithms, Complexity and Models of ComputationInternational audienceIn this work ...
Let G = (V,E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of...
In the graph distance game, two players alternate in constructing a max- imal path. The objective fu...
In the graph distance game, two players alternate in constructing a maximal path. The objective func...
Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then ...
The thesis is devoted to the study of graph and hypergraph games, which are cooperative games with c...
In this paper we study a generalization of the classic network creation game in the scenario in whic...
In this paper we study a generalization of the classic \emph{network creation game} to the scenario ...
In this work we address a game theoretic variant of the shortest path problem, in which two decision...
Inspired by Lelek's idea from [Disjoint mappings and the span of spaces,Fund. Math. 55 (1964), 199 -...
International audienceWe define and study the following two-player game on a graph G. Let k ∈ N *. A...
A \emph{network creation game} simulates a decentralized and non-cooperative building of a communica...
Let G = (V, E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of S is...
We propose the study of many new variants of two-person graph labeling games. Hardly anything has be...
Part 1: Track A: Algorithms, Complexity and Models of ComputationInternational audienceIn this work ...
Let G = (V,E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of...