The Complexity of deciding stability under FFS in the adversarial model

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97336

Title:	The Complexity of deciding stability under FFS in the adversarial model
Author:	Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Díaz Cort, Josep; Fernández Anta, Antonio; Serna Iglesias, María José
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	In this paper we show the polynomial time decidability of the stability property under FFS in the case that the adversary can solve ties arbitrarily. This results follows from a characterization of the stability property in terms of a family of forbidden subgraphs.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica -Complexity -Stability -FFS -Adversarial model
Rights:
Document type:	Article - Published version Report
Share: