Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

Article Details
Title:	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
Article URLs:	https://doi.org/10.1137/1.9781611974782.124 http://dl.acm.org/citation.cfm?id=3039810
Alternative Article URLs:
Authors:	Shiri Chechik	Tel Aviv University
	Thomas Dueholm Hansen	Aarhus University
	Giuseppe F. Italiano	Università di Roma Tor Vergata
	Veronika Loitzenbauer	University of Vienna
	Nikos Parotsidis	Università di Roma Tor Vergata
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/soda/ChechikHILP17
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2017