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.
| Authors: | , , , , |
|---|---|
| Format: | report |
| Publication Date: | 2003 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97336 |
| Online Access: | https://hdl.handle.net/2117/97336 |
| Access Level: | Open access |
| Keyword: | Complexity Stability FFS Adversarial model Àrees temàtiques de la UPC::Informàtica |
| Summary: | 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. |
|---|