License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2016.1
URN: urn:nbn:de:0030-drops-63451
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6345/
Go to the corresponding LIPIcs Volume Portal

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Parotsidis, Nikos

2-Connectivity in Directed Graphs (Invited Talk)

pdf-format:
LIPIcs-ESA-2016-1.pdf (1 MB)

Abstract

We survey some recent results on 2-edge and 2-vertex connectivity problems in directed graphs. Despite being complete analogs of the corresponding notions on undirected graphs, in digraphs 2-vertex and 2-edge connectivity have a much richer and more complicated structure. It is thus not surprising that 2-connectivity problems on directed graphs appear to be more difficult than on undirected graphs. For undirected graphs it has been known for over 40 years how to compute all bridges, articulation points, 2-edge- and 2-vertex-connected components in linear time, by simply using depth-first search. In the case of digraphs, however, the very same problems have been much more challenging and required the development of new tools and techniques.

BibTeX - Entry

@InProceedings{georgiadis_et_al:LIPIcs:2016:6345,
  author =	{Loukas Georgiadis and Giuseppe F. Italiano and Nikos Parotsidis},
  title =	{{2-Connectivity in Directed Graphs (Invited Talk)}},
  booktitle =	{24th Annual European Symposium on Algorithms (ESA 2016)},
  pages =	{1:1--1:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-015-6},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{57},
  editor =	{Piotr Sankowski and Christos Zaroliagis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6345},
  URN =		{urn:nbn:de:0030-drops-63451},
  doi =		{10.4230/LIPIcs.ESA.2016.1},
  annote =	{Keywords: 2-edge and 2-vertex connectivity on directed graphs, graph algorithms, dominator trees}
}

Keywords: 2-edge and 2-vertex connectivity on directed graphs, graph algorithms, dominator trees
Collection: 24th Annual European Symposium on Algorithms (ESA 2016)
Issue Date: 2016
Date of publication: 18.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI