Nikos Parotsidis

activity

20142026

most citedBalancing Information Exposure in Social Networks

39 citations · 78 across the 27 of their papers we have counts for

collaborators

Showing 2016 · cs.DSShow all

2 papers · 2 filters

cs.DS2016

All-Pairs 2-Reachability in $O (n^{ω} lo g n)$ Time

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano +2

In the $2$ -reachability problem we are given a directed graph $G$ and we wish to determine if there are two (edge or vertex) disjoint paths from $u$ to $v$ , for a given pair of ver…

cs.DS2016

Incremental $2$ -Edge-Connectivity in Directed Graphs

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

In this paper, we initiate the study of the dynamic maintenance of $2$ -edge-connectivity relationships in directed graphs. We present an algorithm that can update the $2$ -edge-conn…

All-Pairs 2-Reachability in O(nωlogn) Time

Incremental 2-Edge-Connectivity in Directed Graphs

All-Pairs 2-Reachability in $O (n^{ω} lo g n)$ Time

Incremental $2$ -Edge-Connectivity in Directed Graphs