The Complexity of deciding stability under FFS in the adversarial model
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.
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97336 |
| Acceso en línea: | https://hdl.handle.net/2117/97336 |
| Access Level: | acceso abierto |
| Palabra clave: | Complexity Stability FFS Adversarial model Àrees temàtiques de la UPC::Informàtica |
| Sumario: | 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. |
|---|