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

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

Standard

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. / Chechik, Shiri; Hansen, Thomas Dueholm; Italiano, Giuseppe F.; Loitzenbauer, Veronika; Parotsidis, Nikos.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2017. p. 1900-1918.

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

Harvard

Chechik, S, Hansen, TD, Italiano, GF, Loitzenbauer, V & Parotsidis, N 2017, Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 1900-1918, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, 16/01/2017. https://doi.org/10.1137/1.9781611974782.124

APA

Chechik, S., Hansen, T. D., Italiano, G. F., Loitzenbauer, V., & Parotsidis, N. (2017). Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1900-1918). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.124

CBE

Chechik S, Hansen TD, Italiano GF, Loitzenbauer V, Parotsidis N. 2017. Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 1900-1918. https://doi.org/10.1137/1.9781611974782.124

MLA

Chechik, Shiri et al. "Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs". Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. 2017, 1900-1918. https://doi.org/10.1137/1.9781611974782.124

Vancouver

Chechik S, Hansen TD, Italiano GF, Loitzenbauer V, Parotsidis N. Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. 2017. p. 1900-1918 https://doi.org/10.1137/1.9781611974782.124

Author

Chechik, Shiri ; Hansen, Thomas Dueholm ; Italiano, Giuseppe F. ; Loitzenbauer, Veronika ; Parotsidis, Nikos. / Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2017. pp. 1900-1918

Bibtex

@inproceedings{efd2bde8cfac4229b4360373ba2d3d73,
title = "Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs",
author = "Shiri Chechik and Hansen, {Thomas Dueholm} and Italiano, {Giuseppe F.} and Veronika Loitzenbauer and Nikos Parotsidis",
year = "2017",
doi = "10.1137/1.9781611974782.124",
language = "English",
isbn = "978-1-61197-478-2",
pages = "1900--1918",
booktitle = "Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Society for Industrial and Applied Mathematics",
note = "28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 ; Conference date: 16-01-2017 Through 19-01-2017",

}

RIS

TY - GEN

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

AU - Chechik, Shiri

AU - Hansen, Thomas Dueholm

AU - Italiano, Giuseppe F.

AU - Loitzenbauer, Veronika

AU - Parotsidis, Nikos

PY - 2017

Y1 - 2017

U2 - 10.1137/1.9781611974782.124

DO - 10.1137/1.9781611974782.124

M3 - Article in proceedings

SN - 978-1-61197-478-2

SP - 1900

EP - 1918

BT - Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

PB - Society for Industrial and Applied Mathematics

T2 - 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017

Y2 - 16 January 2017 through 19 January 2017

ER -