
Improved LinearTime Algorithm for Computing the 4EdgeConnected Components of a Graph
We present an improved algorithm for computing the 4edgeconnected comp...
read it

Computing the 4EdgeConnected Components of a Graph in Linear Time
We present the first lineartime algorithm that computes the 4edgeconn...
read it

Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming
In many real datasets such as social media streams and cyber data source...
read it

Planar Reachability Under Single Vertex or Edge Failures
In this paper we present an efficient reachability oracle under singlee...
read it

AllPairs LCA in DAGs: Breaking through the O(n^2.5) barrier
Let G=(V,E) be an nvertex directed acyclic graph (DAG). A lowest common...
read it

Dynamic Algorithms for the Massively Parallel Computation Model
The Massive Parallel Computing (MPC) model gained popularity during the ...
read it

Dominating Sets and Connected Dominating Sets in Dynamic Graphs
In this paper we study the dynamic versions of two basic graph problems:...
read it

Faster Algorithms for AllPairs Bounded MinCuts
Given a directed graph, the vertex connectivity from u to v is the maxim...
read it

Decremental SPQRtrees for Planar Graphs
We present a decremental data structure for maintaining the SPQRtree of...
read it

Incremental Strong Connectivity and 2Connectivity in Directed Graphs
In this paper, we present new incremental algorithms for maintaining dat...
read it
Giuseppe F. Italiano
is this you? claim profile