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

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

Content
Grafik
Authors
  • Chechik, Shiri
  • Hansen, Thomas Dueholm
  • Italiano, Giuseppe F.
  • Loitzenbauer, Veronika
  • Parotsidis, Nikos
Grafik Top
Projects
Grafik Top
Shortfacts
Category
 Paper in Conference Proceedings or in Workshop Proceedings
Event Title
 ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)
Divisions
 Theory and Applications of Algorithms
Subjects
 Theoretische Informatik
Event Location
 Barcelona, Spain
Event Type
 Conference
Event Dates
 16-19 Jan 2017
Date
 January 2017
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.