Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
The uniqueness of an optimal solution to a combinatorial optimization problem attracts many
fields of researchers' attention because it has a wide range of applications, it is related to …
fields of researchers' attention because it has a wide range of applications, it is related to …
Winner determination algorithms for graph games with matching structures
Abstract Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They
are interpreted as edge-selecting-type games on graphs, and the selected edges during a …
are interpreted as edge-selecting-type games on graphs, and the selected edges during a …
Winner determination algorithms for graph games with matching structures
Abstract Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They
are interpreted as edge-selecting-type games on graphs, and the selected edges during a …
are interpreted as edge-selecting-type games on graphs, and the selected edges during a …
Impartial intersection restriction games
MA Huggan - 2015 - repository.library.carleton.ca
Intersection restriction games are games played on hypergraphs in which options for a
player are restricted based on previous play via some intersection property. This paper …
player are restricted based on previous play via some intersection property. This paper …
Faster Winner Determination Algorithms for (Colored) Arc Kayles
Abstract Arc Kayles and Colored Arc Kayles, two-player games on a graph, are generalized
versions of well-studied combinatorial games Cram and Domineering, respectively. In Arc …
versions of well-studied combinatorial games Cram and Domineering, respectively. In Arc …
On structural parameterizations of node kayles
Node Kayles is a well-known two-player impartial game on graphs: Given an undirected
graph, each player alternately chooses a vertex not adjacent to previously chosen vertices …
graph, each player alternately chooses a vertex not adjacent to previously chosen vertices …
[PDF][PDF] Criticalité, identification et jeux de suppression de sommets dans les graphes
AGP DAILLY - hal.science
Résumé Dans cette thèse, nous étudions des problématiques de graphes et de jeux
combinatoires. Il existe de nombreux liens entre ces deux domaines: ainsi, les jeux sont un …
combinatoires. Il existe de nombreux liens entre ces deux domaines: ainsi, les jeux sont un …
[PDF][PDF] Criticality, identification and vertex deletion games on graphs
A Dailly - Theses Université de Lyon, 2018 - daillya.github.io
In this thesis, we study both graphs and combinatorial games. There are several links
between those two domains: games are useful for modeling an opponent in optimization …
between those two domains: games are useful for modeling an opponent in optimization …
[PDF][PDF] Winner Determination Algorithms for Colored Arc Kayles
Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They are
interpreted as edgeselecting-type games on graphs, and the selected edges during a game …
interpreted as edgeselecting-type games on graphs, and the selected edges during a game …
Criticalité, identification et jeux de suppression de sommets dans les graphes: Des étoiles plein les jeux
A Dailly - 2018 - theses.hal.science
Dans cette thèse, nous étudions des problématiques de graphes et de jeux combinatoires. Il
existe de nombreux liens entre ces deux domaines: ainsi, les jeux sont un bon moyen de …
existe de nombreux liens entre ces deux domaines: ainsi, les jeux sont un bon moyen de …