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 ...

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. ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...