{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:50:46Z","timestamp":1725936646315},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731162"},{"type":"electronic","value":"9783319731179"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_21","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T11:45:34Z","timestamp":1513856734000},"page":"295-304","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Babenko","sequence":"first","affiliation":[]},{"given":"Ignat","family":"Kolesnichenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"issue":"9","key":"21_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-35843-2_14","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"M Babenko","year":"2013","unstructured":"Babenko, M.: Flow decompositions in external memory. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 146\u2013156. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35843-2_14"},{"key":"21_CR3","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 139\u2013149 (1995)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S089548019733103X","volume":"12","author":"AV Goldberg","year":"1999","unstructured":"Goldberg, A.V., Rao, S.: Flows in undirected unit capacity networks. SIAM J. Discret. Math. 12(1), 1\u20135 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Levine, M.S.: Finding maximum flows in undirected graphs seems easier than bipartite matching. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 69\u201378, ACM, New York (1998)","DOI":"10.1145\/276698.276714"},{"key":"21_CR6","unstructured":"Munagala, K., Ranade, A.: I\/O-complexity of graph algorithms. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 687\u2013694. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36574-5","volume-title":"Algorithms for Memory Hierarchies: Advanced Lectures","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies: Advanced Lectures. LNCS, vol. 2625. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36574-5"},{"issue":"5&6","key":"21_CR8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7(5&6), 583\u2013596 (1992)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T11:53:59Z","timestamp":1513857239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}