Now showing items 1-18 of 18

    • A differential approach for bounding the index of graphs under perturbations 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011-09-02)
      Article
      Open Access
      This paper presents bounds for the variation of the spectral radius (G) of a graph G after some perturbations or local vertex/edge modifications of G. The perturbations considered here are the connection of a new vertex ...
    • A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs 

      Hidalgo, Marta R.; Joan Arinyo, Robert (2017-03-01)
      Article
      Open Access
      In this work we describe an algorithm to generate tree-decomposable minimally rigid graphs on a given set of vertices V . The main idea is based on the well-known fact that all minimally rigid graphs, also known as Laman ...
    • A note on the subgraphs of the (2×\infty)-grid 

      Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios (2010-02)
      Article
      Restricted access - publisher's policy
      We give a linear-time algorithm checking whether a graph is a subgraph of the (2×k)-grid for some value of k. Our algorithm is based on a detailed characterization of the structure of such graphs.
    • An Efficient representation for sparse graphs 

      Valiente Feruglio, Gabriel Alejandro (2002-02)
      External research report
      Open Access
      The design of efficient graph algorithms usually precludes the test of edge existence, because an efficient support of that operation already requires time (n^2) for the initialization of an adjacency-matrix representation. ...
    • Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes 

      Foucaud, Florent (2015-03-01)
      Article
      Open Access
      An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code ...
    • Disseny d’una xarxa de transport escolar a Sarrià – Sant Gervasi 

      Puig i Cantín, Guillermo (Universitat Politècnica de Catalunya, 2016-09)
      Master thesis (pre-Bologna period)
      Open Access
      Aquest projecte pretén desenvolupar una solució vial per a una zona com és la part alta del districte de Sarrià-Sant Gervasi, caracteritzada per un gran nombre d’escoles de volums d’alumnes molt importants. L’objectiu ...
    • Dominating sets in planar graphs: branch-width and exponential speed-up 

      Fomin, Fedor V.; Thilikos Touloupas, Dimitrios (2002-12)
      External research report
      Open Access
      Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of ...
    • Graphs, Friends and Acquaintances 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2010-04-23)
      External research report
      Open Access
      As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs ...
    • High quality, scalable and parallel community detection for large real graphs 

      Prat Pérez, Arnau; Domínguez Sal, David; Larriba Pey, Josep (Association for Computing Machinery (ACM), 2014)
      Conference report
      Restricted access - publisher's policy
      Community detection has arisen as one of the most relevant topics in the field of graph mining, principally for its applications in domains such as social or biological networks analysis. Different community detection ...
    • Modelling service-oriented computing with temporal symbolic graph transformation systems 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando; Fiadeiro, José (2015-12-21)
      External research report
      Open Access
      In this paper, we present a novel semantics for an essential aspect of service-oriented computing: the mechanism through which systems evolve through a symbiosis of state transformations and run-time service discovery and ...
    • On the maximum common embedded subtree problem for ordered trees 

      Valiente Feruglio, Gabriel Alejandro (2003-03)
      External research report
      Open Access
      The maximum common embedded subtree problem, which generalizes the subtree homeomorphism problem, is reduced for ordered trees to a variant of the longest common subsequence problem, called the longest common balanced ...
    • Put three and three together: Triangle-driven community detection 

      Prat Pérez, Arnau; Domínguez Sal, David; Brunat Blay, Josep Maria; Larriba Pey, Josep (Association for Computing Machinery (ACM), 2016-02-01)
      Article
      Open Access
      Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing ...
    • Simple and efficient tree comparison 

      Valiente Feruglio, Gabriel Alejandro (2001-01-08)
      External research report
      Open Access
      A new distance metric for rooted trees is presented which is based on the largest common forest of two rooted trees. The new measure is superior to previous measures based on tree edit distance, because no particular ...
    • Simple and efficient tree pattern matching 

      Valiente Feruglio, Gabriel Alejandro (2000-12)
      External research report
      Open Access
      A simple and efficient algorithm for an extension of the subtree isomorphism problem is presented that computes a certificate for each rooted subtree of a given forest, thereby partitioning the set of rooted subtrees ...
    • Tree edit distance and common subtrees 

      Valiente Feruglio, Gabriel Alejandro (2002-02)
      External research report
      Open Access
      The relationship between tree edit distance and maximum common subtrees is established, showing that a tree edit distance constrained by insertion and deletions on leaves only and by a simple condition on the cost of ...
    • Utilización del Álgebra Lineal para la clasificación por rangos 

      Morán Franqués, Inés (Universitat Politècnica de Catalunya, 2016-01-12)
      Bachelor thesis
      Open Access
      El objetivo principal de este trabajo es, por un lado, conocer cómo se organiza el buscador de Google para devolver una clasificación por rangos de todas las páginas web censadas en la actualidad, al introducir una palabra ...
    • Vertex-Transitive Graphs That Remain Connected After Failure of a Vertex and Its Neighbors 

      Hamidoune, Yahya ould; Lladó Sánchez, Ana M.; López Masip, Susana Clara (Wiley InterScience, 2011-06)
      Article
      Restricted access - publisher's policy
      A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ...
    • Visualització de xarxes - Dibuixos de rectangles d'influència per a grafs bipartits planars 

      Sanmartí Bosch, Aida (Universitat Politècnica de Catalunya, 2012-07-05)
      Bachelor thesis
      Restricted access - author's decision
      Este trabajo se sitúa en el ámbito de Graph Drawing. Los grafos describen relaciones entre objetos y muchas redes que surgen en la práctica se modelan con grafos. El estudio de propiedades de grafos es una de las ramas ...