3 citations · 3 across the 7 of their papers we have counts for
5 papers · 1 filter
-Fault-Tolerant Strong Connectivity Oracles
Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis
We study the problem of efficiently answering strong connectivity queries under two vertex failures. Given a directed graph with vertices, we provide a data structure with…
Connectivity Oracles for Predictable Vertex Failures
Bingbing Hu, Evangelos Kosinas, Adam Polak
The problem of designing connectivity oracles supporting vertex failures is one of the basic data structures problems for undirected graphs. It is already well understood: previous…
Computing the -Edge-Connected Components in Linear Time
Evangelos Kosinas
We provide a deterministic algorithm for computing the -edge-connected components of an undirected multigraph in linear time. There were probably good indications that this comp…
Connectivity Queries under Vertex Failures: Not Optimal, but Practical
Evangelos Kosinas
We revisit once more the problem of designing an oracle for answering connectivity queries in undirected graphs in the presence of vertex failures. Specifically, given an undirecte…
On 2-strong connectivity orientations of mixed graphs and related problems
Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas
A mixed graph is a graph that consists of both undirected and directed edges. An orientation of is formed by orienting all the undirected edges of , i.e., converting eac…