Browsing by Subject "Graph algorithms"
Now showing items 117 of 17

A differential approach for bounding the index of graphs under perturbations
(20110902)
Article
Open AccessThis 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 Hennebergbased algorithm for generating treedecomposable minimally rigid graphs
(20170301)
Article
Open AccessIn this work we describe an algorithm to generate treedecomposable minimally rigid graphs on a given set of vertices V . The main idea is based on the wellknown fact that all minimally rigid graphs, also known as Laman ... 
A note on the subgraphs of the (2×\infty)grid
(201002)
Article
Restricted access  publisher's policyWe give a lineartime 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
(200202)
External research report
Open AccessThe 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 adjacencymatrix representation. ... 
Decision and approximation complexity for identifying codes and locatingdominating sets in restricted graph classes
(20150301)
Article
Open AccessAn 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 ... 
Dominating sets in planar graphs: branchwidth and exponential speedup
(200212)
External research report
Open AccessGraph 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
(20100423)
External research report
Open AccessAs 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
(Association for Computing Machinery (ACM), 2014)
Conference report
Restricted access  publisher's policyCommunity 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 serviceoriented computing with temporal symbolic graph transformation systems
(20151221)
External research report
Open AccessIn this paper, we present a novel semantics for an essential aspect of serviceoriented computing: the mechanism through which systems evolve through a symbiosis of state transformations and runtime service discovery and ... 
On the maximum common embedded subtree problem for ordered trees
(200303)
External research report
Open AccessThe 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: Triangledriven community detection
(Association for Computing Machinery (ACM), 20160201)
Article
Open AccessCommunity 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
(20010108)
External research report
Open AccessA 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
(200012)
External research report
Open AccessA 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
(200202)
External research report
Open AccessThe 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
(Universitat Politècnica de Catalunya, 20160112)
Bachelor thesis
Open AccessEl 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 ... 
VertexTransitive Graphs That Remain Connected After Failure of a Vertex and Its Neighbors
(Wiley InterScience, 201106)
Article
Restricted access  publisher's policyA dregular 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
(Universitat Politècnica de Catalunya, 20120705)
Bachelor thesis
Restricted access  author's decisionEste 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 ...