Ara es mostren els items 36-37 de 37

    • The Complexity of restrictive H-coloring 

      Díaz Cort, Josep; Serna Iglesias, María José; Thilikos Touloupas, Dimitrios (2002-03)
      Report de recerca
      Accés obert
      We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely ...
    • The price of connectedness in expansions 

      Fomin, Fedor V.; Fraigniaud, Pierre; Thilikos Touloupas, Dimitrios (2004-05)
      Report de recerca
      Accés obert
      Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion which naturally arises in a number of applications. Our main tool for this investigation ...