Connected Components in Undirected Set–Based Graphs. Applications in Object–Oriented Model Manipulation

08/10/2020
by   Ernesto Kofman, et al.
0

This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set–Based Graph. The algorithm, under certain restrictions on those sets, has the remarkable property of achieving constant computational costs with the number of vertices and edges. The mentioned restrictions are related to the possibility of representing the sets of vertices by intension and the sets of edges using some particular type of maps. While these restrictions can result strong in a general context, they are usually satisfied in the problem of transforming connections into equations in object oriented models, which is the main application of the proposed algorithm. Besides describing the new algorithm and studying its computational cost, the work describes its prototype implementation and shows its application in different examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2023

On 2-strong connectivity orientations of mixed graphs and related problems

A mixed graph G is a graph that consists of both undirected and directed...
research
05/30/2018

Space-Efficient DFS and Applications: Simpler, Leaner, Faster

The problem of space-efficient depth-first search (DFS) is reconsidered....
research
03/23/2020

Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions

We show how to efficiently solve a clustering problem that arises in a m...
research
01/28/2021

Random Graph Matching with Improved Noise Robustness

Graph matching, also known as network alignment, refers to finding a bij...
research
09/13/2021

A deep learning guided memetic framework for graph coloring problems

Given an undirected graph G=(V,E) with a set of vertices V and a set of ...
research
10/19/2018

On the complexity of color-avoiding site and bond percolation

The mathematical analysis of robustness and error-tolerance of complex n...
research
10/14/2019

FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence

This paper presents a new distributed-memory algorithm called FastSV for...

Please sign up or login with your details

Forgot password? Click here to reset