Now showing items 21-33 of 33

    • 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)
      Bachelor thesis
      Open Access
      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 ...
    • Quantification of network structural dissimilarities 

      Schieber, Tiabo A.; Carpi, Laura; Díaz Guilera, Albert; Pardalos, Panos M.; Masoller Alonso, Cristina; Ravetti, Martin G. (2017-01-09)
      Article
      Open Access
      Identifying and quantifying dissimilarities among graphs is a fundamental and challenging problem of practical importance in many fields of science. Current methods of network comparison are limited to extract only partial ...
    • Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree 

      Cano Vila, María del Pilar; Perarnau Llobet, Guillem; Serra Albó, Oriol (2017-08-01)
      Article
      Open Access
      We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of ...
    • Secret sharing schemes: Optimizing the information ratio 

      Hernández Ansuátegui, Félix (Universitat Politècnica de Catalunya, 2017-07)
      Bachelor thesis
      Open Access
      Secret sharing refers to methods used to distribute a secret value among a set of participants. This work deals with the optimization of two parameters regarding the efficiency of a secret sharing scheme: the information ...
    • Semantic clustering based on ontologies: an application to the study of visitors in a natural reserve 

      Batet, Montserrat; Valls, Aïda; Gibert, Karina (2011)
      Conference report
      Open Access
      The development of large ontologies for general and specific domains provides new tools to improve the quality of data mining techniques such as clustering. In this paper we explain how to improve clustering results by ...
    • Specification and description language for discrete simulation 

      Fonseca Casas, Pau (IGI Global, 2013-07)
      Part of book or chapter of book
      Restricted access - publisher's policy
      Designing a new simulation model usually involves the participation of personnel with different knowledge of the system and with diverse formations. These personnel often use different languages, making more difficult ...
    • Structure and enumeration of K4-minor-free links and link diagrams 

      Rué Perna, Juan José; Thilikos Touloupas, Dimitrios; Velona, Vasiliki (2018-07-01)
      Article
      Open Access
      We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4. We prove that L is the closure of a subclass ...
    • Systematic strategies for 3-dimensional modular robots 

      De Parada Muñoz, Irene María (Universitat Politècnica de Catalunya, 2015-07)
      Master thesis
      Open Access
      Modular robots have been studied an classified from different perspectives, generally focusing on the mechatronics. But the geometric attributes and constraints are the ones that determine the self-reconfiguration strategies. ...
    • The degree-number of vertices problem in Manhattan networks 

      Clavijo Lopez, Hugo; Comas Burcet, Jordi (Universitat Politècnica de Catalunya, 2012-07-19)
      Bachelor thesis
      Open Access
      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 ...
    • The Kernel Matrix Diffie-Hellman assumption 

      Morillo Bosch, M. Paz; Ràfols Salvador, Carla; Villar Santos, Jorge Luis (Springer, 2016)
      Conference lecture
      Open Access
      We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix A sampled from some distribution D, the kernel assumption says that it is hard to find “in the exponent” ...
    • The number of spanning trees in Apollonian networks 

      Zhang, Zhongzhi; Wu, Bin; Comellas Padró, Francesc de Paula (2014-05-31)
      Article
      Open Access
      In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including ...
    • The referee assignment problem 

      Vallespi Soro, Farners (Universitat Politècnica de Catalunya, 2019-07)
      Bachelor thesis
      Open Access
      In collaboration between a UPC spinoff, Barcelogic, and the Dutch Football Federation (KNVB), we define, study, implement and evaluate different approaches for solving the so-called Referee Assignment Problem(RAP). In this ...
    • Theoretical aspects of graph models for MANETS 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Santi, Paolo (2010-03-01)
      External research report
      Open Access
      We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, di erent dynamic graph models of MANETs, and nally ...