ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: 2-Edge Connectivity in Directed Graphs
Article URLs:
Alternative Article URLs: https://arxiv.org/abs/1407.3041 http://dl.acm.org/citation.cfm?doid=2968448
Authors: Loukas Georgiadis
  • University of Ioannina, Greece, Department of Computer Science & Engineering
Giuseppe F. Italiano
  • Universita di Roma Tor Vergata, Roma, Italy, Dipartimento di Ingegneria Civile e Ingegneria Informatica
Luigi Laura
  • Sapienza Universita di Roma, Roma, Italy, Dipartimento di Ingegneria Informatica, Automatica e Gestionale e Centro di Ricerca per il Trasporto e la Logistica (CTL)
Nikos Parotsidis
  • University of Ioannina, Greece, Department of Computer Science & Engineering
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/GeorgiadisILP15
Author Comments: Journal version appeared as "2-Edge Connectivity in Directed Graphs". ACM Trans. Algorithms 13(1): 9:1-9:24 (2016) http://dl.acm.org/citation.cfm?doid=2968448

Discuss this paper and its artifacts below