{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:35:29Z","timestamp":1720200929899},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"vor","delay-in-days":1485,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2012C4E3KT_001"],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1016\/j.tcs.2017.06.015","type":"journal-article","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T03:33:22Z","timestamp":1498534402000},"page":"40-66","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Sparse certificates for 2-connectivity in directed graphs"],"prefix":"10.1016","volume":"698","author":[{"given":"Loukas","family":"Georgiadis","sequence":"first","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]},{"given":"Aikaterini","family":"Karanasiou","sequence":"additional","affiliation":[]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Parotsidis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2017.06.015_br0010","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"issue":"6","key":"10.1016\/j.tcs.2017.06.015_br0020","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1137\/S0097539797317263","article-title":"Dominators in linear time","volume":"28","author":"Alstrup","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2017.06.015_br0030","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1137\/070693217","article-title":"Linear-time algorithms for dominators and other path-evaluation problems","volume":"38","author":"Buchsbaum","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2017.06.015_br0040","series-title":"Proc. 28th ACM\u2013SIAM Symp. on Discrete Algorithms","first-page":"1900","article-title":"Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs","author":"Chechik","year":"2017"},{"issue":"2","key":"10.1016\/j.tcs.2017.06.015_br0050","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1137\/S009753979833920X","article-title":"Approximating minimum-size k-connected spanning subgraphs via matching","volume":"30","author":"Cheriyan","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2017.06.015_br0060","series-title":"Proc. 17th Algorithm Engineering and Experiments","first-page":"173","article-title":"2-Connectivity in directed graphs: an experimental study","author":"Di Luigi","year":"2015"},{"key":"10.1016\/j.tcs.2017.06.015_br0070","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1972"},{"key":"10.1016\/j.tcs.2017.06.015_br0080","series-title":"Proc. 40th ACM Symp. on Theory of Computing","first-page":"153","article-title":"An O(log2\u2061k)-approximation algorithm for the k-vertex connected spanning subgraph problem","author":"Fakcharoenphol","year":"2008"},{"key":"10.1016\/j.tcs.2017.06.015_br0090","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"issue":"4","key":"10.1016\/j.tcs.2017.06.015_br0100","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/net.20289","article-title":"Approximating the smallest k-edge connected spanning subgraph by LP-rounding","volume":"53","author":"Gabow","year":"2009","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.tcs.2017.06.015_br0110","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2017.06.015_br0120","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.tcs.2017.06.015_br0130","series-title":"Proc. 19th European Symposium on Algorithms","first-page":"13","article-title":"Approximating the smallest 2-vertex connected spanning subgraph of a directed graph","author":"Georgiadis","year":"2011"},{"key":"10.1016\/j.tcs.2017.06.015_br0140","series-title":"Proc. 15th Int'l. Symp. on Experimental Algorithms","first-page":"150","article-title":"Sparse subgraphs for 2-connectivity in directed graphs","author":"Georgiadis","year":"2016"},{"key":"10.1016\/j.tcs.2017.06.015_br0150","series-title":"Proc. 42nd Int'l. Coll. on Automata, Languages, and Programming","first-page":"605","article-title":"2-Vertex connectivity in directed graphs","author":"Georgiadis","year":"2015"},{"issue":"1","key":"10.1016\/j.tcs.2017.06.015_br0160","doi-asserted-by":"crossref","first-page":"9:1","DOI":"10.1145\/2968448","article-title":"2-Edge connectivity in directed graphs","volume":"13","author":"Georgiadis","year":"2016","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2017.06.015_br0170","series-title":"Proc. 23rd European Symposium on Algorithms","first-page":"582","article-title":"Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs","author":"Georgiadis","year":"2015"},{"key":"10.1016\/j.tcs.2017.06.015_br0180","series-title":"Proc. 28th ACM-SIAM Symp. on Discrete Algorithms","first-page":"1880","article-title":"Strong connectivity in directed graphs under failures, with applications","author":"Georgiadis","year":"2017"},{"issue":"1","key":"10.1016\/j.tcs.2017.06.015_br0190","first-page":"11:1","article-title":"Dominator tree certification and divergent spanning trees","volume":"12","author":"Georgiadis","year":"2015","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2017.06.015_br0200","series-title":"Proc. 42nd Int'l. Coll. on Automata, Languages, and Programming","first-page":"713","article-title":"Finding 2-edge and 2-vertex strongly connected components in quadratic time","author":"Henzinger","year":"2015"},{"issue":"0","key":"10.1016\/j.tcs.2017.06.015_br0210","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2011.11.011","article-title":"Finding strong bridges and strong articulation points in linear time","volume":"447","author":"Italiano","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2017.06.015_br0220","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1051\/ita\/2015001","article-title":"Computing the 2-blocks of directed graphs","volume":"49","author":"Jaberi","year":"2015","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"4","key":"10.1016\/j.tcs.2017.06.015_br0230","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/S0097539793256685","article-title":"Approximating the minimum equivalent digraph","volume":"24","author":"Khuller","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2017.06.015_br0240","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(95)00105-Z","article-title":"On strongly connected digraphs with bounded cycle length","volume":"69","author":"Khuller","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2017.06.015_br0250","series-title":"Approximation Algorithms and Metaheuristics","article-title":"Approximating minimum cost connectivity problems","author":"Kortsarz","year":"2007"},{"key":"10.1016\/j.tcs.2017.06.015_br0260","series-title":"Proc. 39th Int'l. Coll. on Automata, Languages, and Programming","first-page":"606","article-title":"A rounding by sampling approach to the minimum size k-arc connected subgraph problem","author":"Laekhanukit","year":"2012"},{"key":"10.1016\/j.tcs.2017.06.015_br0270","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"key":"10.1016\/j.tcs.2017.06.015_br0280","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","article-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph","volume":"7","author":"Nagamochi","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2017.06.015_br0290","series-title":"Algorithmic Aspects of Graph Connectivity","author":"Nagamochi","year":"2008"},{"issue":"2","key":"10.1016\/j.tcs.2017.06.015_br0300","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2017.06.015_br0310","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00268499","article-title":"Edge-disjoint spanning trees and depth-first search","volume":"6","author":"Tarjan","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2017.06.015_br0320","series-title":"Proc. 12th ACM\u2013SIAM Symp. on Discrete Algorithms","first-page":"417","article-title":"Approximating the minimum strongly connected subgraph via a matching lower bound","author":"Vetta","year":"2001"},{"issue":"2","key":"10.1016\/j.tcs.2017.06.015_br0330","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(02)00476-3","article-title":"A linear time 5\/3-approximation for the minimum strongly-connected spanning subgraph problem","volume":"86","author":"Zhao","year":"2003","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517305273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517305273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T19:23:19Z","timestamp":1656357799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397517305273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":33,"alternative-id":["S0304397517305273"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.06.015","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sparse certificates for 2-connectivity in directed graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.06.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}
