Ara es mostren els items 41-46 de 46

    • The Complexity of pure Nash equilibria in weighted Max-Congestion Games 

      Álvarez Faura, M. del Carme; Francès Medina, Guillem (Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 2008-03-04)
      Report de recerca
      Accés obert
      We study Network Max-Congestion Games (NMC games, for short), a class of network games where each player tries to minimize the most congested edge along the path he uses as strategy. We focus our study on the complexity ...
    • The Hardness of intervalizing four colored caterpillars 

      Serna Iglesias, María José; Díaz Iriberri, José; Álvarez Faura, M. del Carme (1998-07-02)
      Report de recerca
      Accés obert
      The problem of Intervalizing Colored Graphs (ICG) has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete ...
    • The HOM problem is decidable 

      Godoy, Guillem; Giménez, Omer; Ramos Garrido, Lander; Álvarez Faura, M. del Carme (2009-06)
      Report de recerca
      Accés obert
      We close affirmatively a question which has been open for 35 years: decidability of the HOM problem. The HOM problem consists in deciding, given a tree homomorphism $H$ and a regular tree languagle $L$ represented by a ...
    • The Proper interval colored graph problem for caterpillar trees 

      Álvarez Faura, M. del Carme; Serna Iglesias, María José (1999-04)
      Report de recerca
      Accés obert
      This paper studies the computational complexity of the Proper Interval Colored Graph problem (PICG), when the input graph is a colored tree. We show that the problem is hard for the class of caterpillar trees. To prove ...
    • The robustness of stability under link and node failures 

      Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Serna Iglesias, María José (2007-07)
      Report de recerca
      Accés obert
      In the area of communication systems, stability refers to the property of keeping the amount of traffic in the system always bounded over time. Different communication system models have been proposed in order to capture ...
    • Universal stability of undirected graphs in the adversarial queueing model 

      Álvarez Faura, M. del Carme; Serna Iglesias, María José; Blesa Aguilera, Maria Josep (2002-03)
      Report de recerca
      Accés obert
      In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting packets must be injected in some edge and have to traverse a path before leaving ...