The Largest Connected Subgraph Game - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2021

The Largest Connected Subgraph Game

Résumé

In each round of the largest connected subgraph game, Alice first colours an uncoloured vertex red, and then, Bob colours an uncoloured vertex blue, with all vertices initially un-coloured. Once all the vertices are coloured, Alice (Bob, resp.) wins if the connected subgraphof maximum order is red (blue, resp.). We first prove that Bob can never win, and define a large class of graphs, called reflection graphs, in which the game is a draw. We then show that determining the outcome of the game is PSPACE-complete, even in bipartite graphs of small diameter, and that recognizing reflection graphs is GI-hard. We also prove that the game is a draw in paths if and only if the path is of even order or of sufficient length, and that Alice wins in cycles if and if only if the cycle is of odd length. Lastly, we give an algorithm that determines the outcome of the game in cographs in linear time.
Fichier principal
Vignette du fichier
The_Largest_Connected_Subgraph_Game.pdf (758.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03137305 , version 1 (10-02-2021)
hal-03137305 , version 2 (04-03-2021)
hal-03137305 , version 3 (05-03-2021)
hal-03137305 , version 4 (25-06-2021)

Identifiants

  • HAL Id : hal-03137305 , version 1

Citer

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse. The Largest Connected Subgraph Game. [Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France; CISPA Helmholtz Center for Information Security, Saarbrücken, Germany. 2021. ⟨hal-03137305v1⟩
241 Consultations
534 Téléchargements

Partager

Gmail Facebook X LinkedIn More