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

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Shiri Chechik, Tel Aviv University (TAU), Tel Aviv
  • ,
  • Thomas Dueholm Hansen
  • ,
  • Giuseppe F. Italiano, Universit`a di Roma Tor Vergata
  • ,
  • Veronika Loitzenbauer, University of Vienna
  • ,
  • Nikos Parotsidis, Universit`a di Roma Tor Vergata
Original languageEnglish
Title of host publicationProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Number of pages19
PublisherSociety for Industrial and Applied Mathematics
Publication year2017
Pages1900-1918
ISBN (print)978-1-61197-478-2
DOIs
Publication statusPublished - 2017
Event28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 - Barcelona, Spain
Duration: 16 Jan 201719 Jan 2017

Conference

Conference28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
LandSpain
ByBarcelona
Periode16/01/201719/01/2017
SponsorUniversitat Politècnica de Catalunya

See relations at Aarhus University Citationformats

ID: 120543012