Exploració per tema "Graph coloring"

Ara es mostren els items 1-9 de 9

    • Approximation schemes for randomly sampling colorings 

      González I Sentís, Marta (Universitat Politècnica de Catalunya, 2019-10)
      Projecte Final de Màster Oficial
      Accés obert
      Graph colouring is arguably one of the most important issues in Graph Theory. However, many of the questions that arise in the area such as the chromatic number problem or counting the number of proper colorings of a graph ...

    • Approximations of the aggregated interference statistics for outage analysis in massive MTC 

      Liesegang Maria, Sergi; Pascual Iserte, Antonio; Muñoz Medina, Olga (Multidisciplinary Digital Publishing Institute (MDPI), 2019-12)
      Article
      Accés obert
      This paper presents several analytic closed-form approximations of the aggregated interference statistics within the framework of uplink massive machine-type-communications (mMTC), taking into account the random activity ...

    • Coloración de grafos 

      Fiol Mora, Miquel Àngel (2000-05)
      Article
      Accés obert
      Estudiamos algunos resultados sobre rama-coloración de grafos y su relación con el teorema del mapa de cuatro colores. A tal fin, se introduce la noción de “coloración” de una conjunto de ramas y se estudian sus propiedades ...

    • Delay minimization in dynamic and scalable multi-operator wireless backhauling 

      Surís, Didac; Agustín de Dios, Adrián; Vidal Manzano, José (Institute of Electrical and Electronics Engineers (IEEE), 2017)
      Text en actes de congrés
      Accés obert
      This paper focuses on the optimization of routing and interference-aware resource allocation for a wireless backhaul network, focusing on the end-to-end delay minimization. We adopt a convex optimization formulation, which ...

    • Long-term provisioning of radio resources based on their utilization in dense OFDMA networks 

      Lagén Morancho, Sandra; Muñoz Medina, Olga; Pascual Iserte, Antonio; Vidal Manzano, José; Agustín de Dios, Adrián (Institute of Electrical and Electronics Engineers (IEEE), 2016)
      Text en actes de congrés
      Accés obert
      This paper presents long-term resource provisioning schemes for dense multi-cell OFDMA-based networks, where multiple cells with possibly overlapping coverage areas compete for the same set of resources. The optimization ...

    • Online coloring problem with a randomized adversary and infinite advice 

      Burjons Pujol, Elisabet (Universitat Politècnica de Catalunya, 2015-07)
      Projecte Final de Màster Oficial
      Accés obert
      Online problems are those in which the instance is not given as a whole but by parts named requests. They arrise naturaly in computer science. Several examples are given such as ski rental problem, the server problem and ...

    • Probabilistic methods and coloring problems in graphs 

      Perarnau Llobet, Guillem (Universitat Politècnica de Catalunya, 2010-06)
      Projecte Final de Màster Oficial
      Accés obert
      Aquest projecte està dedicat a estudiar el k-èssim nombre cromàtic generalitzat que sorgeix de les descomposicions Low Tree--Depth en grafs usant mètodes probabilístics.. Una extensió natural del nombre cromàtic d'un graf ...

    • Super edge-magic models 

      López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (2011-04-20)
      Article
      Accés obert
      In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.

    • The generalized hierarchical product of graphs 

      Barrière Figueroa, Eulalia; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida (2008-01)
      Article
      Accés obert
      A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs ...