activity
20122021
most citedReal-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components

13 citations · 14 across the 7 of their papers we have counts for

collaborators

8 papers

cs.LG2021★ 1 cited

Complexity-based partitioning of CSFI problem instances with Transformers

Luca Benedetto, Paolo Fantozzi, Luigi Laura

In this paper, we propose a two-steps approach to partition instances of the Conjunctive Normal Form (CNF) Syntactic Formula Isomorphism problem (CSFI) into groups of different com…

cs.DS2016

On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications

Loukas Georgiadis, Aikaterini Karanasiou, Giannis Konstantinos +1

A flow graph is a directed graph with a distinguished start vertex . The dominator tree of is a tree rooted at , such that a vertex is an ancestor of…

cs.DS2016

An Experimental Study of Dynamic Dominators

Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura +1

Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and de…

cs.DS2015

Dynamic subtrees queries revisited: the Depth First Tour Tree

Gabriele Farina, Luigi Laura

In the dynamic tree problem the goal is the maintenance of an arbitrary n-vertex forest, where the trees are subject to joining and splitting by, respectively, adding and removing…

cs.DS2014

2-Vertex Connectivity in Directed Graphs

Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura +1

We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are…

cs.DS2014

2-Edge Connectivity in Directed Graphs

Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura +1

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been inve…

cs.DS2014

Experimental Evaluation of Algorithms for the Food-Selection Problem

Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano +1

In this paper, we describe the result of our experiments on Algorithms for the Food-Selection Problem, which is the fundamental problem first stated and addressed in the seminal pa…

cs.DS2012★ 13 cited

Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components

Giorgio Ausiello, Donatella Firmani, Luigi Laura

In this paper we present the first algorithm in the streaming model to characterize completely the biconnectivity properties of undirected networks: articulation points, bridges, a…