Exploració per tema "Graph algorithms"

Ara es mostren els items 1-20 de 32

    • 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
      Accés obert
      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 generaliser applied to SBL 

      Moreno Ribas, Antonio (1992-03)
      Report de recerca
      Accés obert
      In this work two algorithms have been developed: a generaliser and a hierarchy constructor. The generaliser receives as inputs the descriptions of some positive examples of a concept and it calculates their maximal conjunctive ...

    • A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs 

      Hidalgo, Marta R.; Joan Arinyo, Robert (2017-03-01)
      Article
      Accés obert
      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 logic-based incremental approach to graph repair featuring delta preservation 

      Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (Springer Nature, 2021-07-07)
      Article
      Accés obert
      We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized ...

    • A multi-stage graph based algorithm for survivable Service Function Chain orchestration with backup resource sharing 

      Kibalya, Godfrey Mirondo; Serrat Fernández, Juan; Gorricho Moreno, Juan Luis; Serugunda, Jonathan; Zhang, Peiying (Elsevier, 2021-06)
      Article
      Accés obert
      Network softwarisation introduces flexibility in network management by enabling the deployment of network functions as software modules running on virtual machines. However, this creates new concerns for service availability ...

    • A note on the subgraphs of the (2×\infty)-grid 

      Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios (2010-02)
      Article
      Accés restringit per política de l'editorial
      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.

    • Adjacency maps and efficient graph algorithms 

      Valiente Feruglio, Gabriel Alejandro (Multidisciplinary Digital Publishing Institute (MDPI), 2022-02-20)
      Article
      Accés obert
      Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the ...

    • Algorithms to prevent attacks in active directory environments 

      Ibars Cubel, Albert (Universitat Politècnica de Catalunya, 2022-10-21)
      Treball Final de Grau
      Accés obert
      Microsoft Active Directory is the default management system for Windows domain networks, so convenient that it is used in many organizations worldwide. Because of this popularity, AD has been a focused cyberattack target. ...

    • Algoritmos de distancias mínimas en grafos 

      Balcázar Navarro, José Luis (1986-05)
      Report de recerca
      Accés obert

    • An Efficient representation for sparse graphs 

      Valiente Feruglio, Gabriel Alejandro (2002-02)
      Report de recerca
      Accés obert
      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. ...

    • Aplicació de xarxes per la detecció de relacions complexes de frau 

      Clarà Ventosa, Ona (Universitat Politècnica de Catalunya, 2023-06-27)
      Treball Final de Grau
      Accés restringit per acord de confidencialitat
      Realitzat a/amb:   Grupo Catalana Occidente

    • Approximating layout problems on geometric random graphs 

      Díaz Cort, Josep; Penrose, Mathew D.; Petit Silvestre, Jordi; Serna Iglesias, María José (1998-10-13)
      Report de recerca
      Accés obert
      We show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout ...

    • Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes 

      Foucaud, Florent (2015-03-01)
      Article
      Accés obert
      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 ...

    • Desenvolupament d'una interfície de consultes per l'eina ODIN 

      Valencia Luque, Pol (Universitat Politècnica de Catalunya, 2023-06-27)
      Treball Final de Grau
      Accés obert
      El grup de recerca DTIM de la UPC ha desenvolupat ODIN, una eina que permet la integració de fonts de dades en diferents formats emprant un model basat en grafs com a model canònic. Una de les finalitats d'aquest sistema ...

    • Dominating sets in planar graphs: branch-width and exponential speed-up 

      Fomin, Fedor V.; Thilikos Touloupas, Dimitrios (2002-12)
      Report de recerca
      Accés obert
      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)
      Report de recerca
      Accés obert
      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)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      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 ...

    • Implementing and evaluating graph algorithms for long vector architectures 

      Vizcaíno Serrano, Pablo (Universitat Politècnica de Catalunya, 2023-05-15)
      Projecte Final de Màster Oficial
      Accés obert
      High-Performance Computing can be accelerated using long-vector architectures. However, creating efficient coding implementations for these architectures can be challenging. This Master's thesis focuses on implementing ...

    • Modelling service-oriented computing with temporal symbolic graph transformation systems 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando; Fiadeiro, José Luiz (2015-12-21)
      Report de recerca
      Accés obert
      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)
      Report de recerca
      Accés obert
      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 ...