Exploració per altres contribucions "Dalfó Simó, Cristina"

Ara es mostren els items 1-4 de 4

    • (1, ≤ ℓ)-identifying codes in digraphs and graphs 

      Martínez Barona, Berenice (Universitat Politècnica de Catalunya, 2020-09-14)
      Tesi
      Accés obert
      The main subject of this PhD thesis is the study of (1,=l)-identifying codes in digraphs. The results presented in this work are divided into three parts. The first one focusses on the structural properties of digraphs ...

    • Apunts de Matemàtiques de la telecomunicació 

      Andrés Yebra, José Luis (Universitat Politècnica de Catalunya, 2010)
      Apunts
      Accés obert

    • El problema grau-nombre de vèrtexs en digrafs de doble pas amb diàmetre unilateral 

      Romero Nevado, Cristina (Universitat Politècnica de Catalunya, 2013-02-26)
      Treball Final de Grau
      Accés obert
      Generally speaking, the aim of this work is to study the (Δ,N) problem (or the degree-number of vertices problem) for double-step digraphs. A digraph is a network consisting of vertices and directed edges (called ...

    • The degree-number of vertices problem in Manhattan networks 

      Clavijo Lopez, Hugo; Comas Burcet, Jordi (Universitat Politècnica de Catalunya, 2012-07-19)
      Treball Final de Grau
      Accés obert
      Generally speaking, the aim of this work is to study the problem (Delta,N) (or the degree-number of vertices problem) for the case of a Manhattan digraph. A digraph is a network formed by vertices and directed edges called ...