Open AccessStrong Connectivity in Directed Graphs under Failures, with Applications
Author(s) -
Loukas Georgiadis,
Giuseppe F. Italiano,
Nikos Parotsidis
Publication year - 2020
Publication title -
siam journal on computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.533
H-Index - 122
eISSN - 1095-7111
pISSN - 0097-5397
DOI - 10.1137/19m1258530
Subject(s) - computer science , combinatorics , theoretical computer science , mathematics , discrete mathematics
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 $G\setminus e$ (resp., $G\setminus v$) be...
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom