Search Results - "Georgiadis, Loukas"

An O( n log n ) version of the Averbakh–Berman algorithm for the robust median of a tree by Brodal, Gerth Stølting, Georgiadis, Loukas, Katriel, Irit

“…We show that the minmax regret median of a tree can be found in O( n log n ) time. This is obtained by a modification of Averbakh and Berman's O( n log 2 n…”
Get full text

Sparse certificates for 2-connectivity in directed graphs by Georgiadis, Loukas, Italiano, Giuseppe F., Karanasiou, Aikaterini, Papadopoulos, Charis, Parotsidis, Nikos

“…Motivated by the emergence of large-scale networks in today's applications, we show how to compute efficiently smaller subgraphs that maintain some properties…”
Get full text

Finding dominators via disjoint set union by Fraczak, Wojciech, Georgiadis, Loukas, Miller, Andrew, Tarjan, Robert E.

“…The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and…”
Get full text

Strong Articulation Points and Strong Bridges in Large Scale Graphs by Firmani, Donatella, Georgiadis, Loukas, Italiano, Giuseppe F., Laura, Luigi, Santaroni, Federico

“…Let G = ( V , E ) be a directed graph. A vertex v ∈ V (respectively an edge e ∈ E ) is a strong articulation point (respectively a strong bridge ) if its…”
Get full text

Join-Reachability Problems in Directed Graphs by Georgiadis, Loukas, Nikolopoulos, Stavros D., Palios, Leonidas

“…For a given collection of directed graphs we define the join-reachability graph of , denoted by , as the directed graph that, for any pair of vertices u and  v…”
Get full text

Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20] by Fraczak, Wojciech, Georgiadis, Loukas, Miller, Andrew, Tarjan, Robert E.

Get full text

2$-Fault-Tolerant Strong Connectivity Oracles by Georgiadis, Loukas, Kosinas, Evangelos, Tsokaktsis, Daniel

“…We study the problem of efficiently answering strong connectivity queries under two vertex failures. Given a directed graph $G$ with $n$ vertices, we provide a…”
Get full text

Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems by Georgiadis, Loukas, Kosinas, Evangelos

“…A directed graph $G=(V,E)$ is twinless strongly connected if it contains a strongly connected spanning subgraph without any pair of antiparallel (or twin)…”
Get full text

On 2-strong connectivity orientations of mixed graphs and related problems by Georgiadis, Loukas, Kefallinos, Dionysios, Kosinas, Evangelos

“…A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$,…”
Get full text

Finding Dominators in Practice by Georgiadis, Loukas, Tarjan, Robert E., Werneck, Renato F.

Get full text

Improved Linear-Time Algorithm for Computing the $4$-Edge-Connected Components of a Graph by Georgiadis, Loukas, Italiano, Giuseppe F, Kosinas, Evangelos

“…We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary…”
Get full text

Computing the $4$-Edge-Connected Components of a Graph in Linear Time by Georgiadis, Loukas, Italiano, Giuseppe F, Kosinas, Evangelos

“…We present the first linear-time algorithm that computes the $4$-edge-connected components of an undirected graph. Hence, we also obtain the first linear-time…”
Get full text

On maximal k-edge-connected subgraphs of undirected graphs by Georgiadis, Loukas, Italiano, Giuseppe F, Kosinas, Evangelos, Pattanayak, Debasish

“…We show how to find and efficiently maintain maximal k-edge-connected subgraphs in undirected graphs. In particular, we provide the following results. (1) A…”
Get full text

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs by Georgiadis, Loukas, Italiano, Giuseppe F, Parotsidis, Nikos

“…In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs…”
Get full text

A Note on Fault Tolerant Reachability for Directed Graphs by Georgiadis, Loukas, Tarjan, Robert E

“…In this note we describe an application of low-high orders in fault-tolerant network design. Baswana et al. [DISC 2015] study the following reachability…”
Get full text

Incremental $2$-Edge-Connectivity in Directed Graphs by Georgiadis, Loukas, Italiano, Giuseppe F, Parotsidis, Nikos

“…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…”
Get full text

Linear-time algorithms for dominators and related problems by Georgiadis, Loukas

“…This dissertation deals with several topics related to the problem of finding dominators in flowgraphs. The concept of dominators has applications in various…”
Get full text

Linear-time algorithms for dominators and related problems by Georgiadis, Loukas

“…This dissertation deals with several topics related to the problem of finding dominators in flowgraphs. The concept of dominators has applications in various…”
Get full text

Strong Connectivity in Directed Graphs under Failures, with Application by Georgiadis, Loukas, Italiano, Giuseppe F, Parotsidis, Nikos

“…In this paper, we investigate some basic connectivity problems in directed graphs (digraphs). Let $G$ be a digraph with $m$ edges and $n$ vertices, and let…”
Get full text

On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications by Georgiadis, Loukas, Karanasiou, Aikaterini, Konstantinos, Giannis, Laura, Luigi

“…A flow graph $G=(V,E,s)$ is a directed graph with a distinguished start vertex $s$. The dominator tree $D$ of $G$ is a tree rooted at $s$, such that a vertex…”
Get full text