{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:12Z","timestamp":1742600412474,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606925"},{"type":"electronic","value":"9783540492634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60692-0_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:53:04Z","timestamp":1330289584000},"page":"363-376","source":"Crossref","is-referenced-by-count":0,"title":["All-pairs min-cut in sparse networks"],"prefix":"10.1007","author":[{"given":"Srinivasa R.","family":"Arikati","sequence":"first","affiliation":[]},{"given":"Shiva","family":"Chaudhuri","sequence":"additional","affiliation":[]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"26_CR1","unstructured":"R. Ahuja, T. Magnanti and J. Orlin, \u201cNetwork Flows\u201d, Prentice-Hall, 1993."},{"key":"26_CR2","unstructured":"N. Alon and B. Schieber, \u201cOptimal Preprocessing for Answering On-line Product Queries\u201d, Tech. Rep. No. 71\/87, Tel-Aviv University, 1987."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"S. Arnborg, \u201cEfficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability \u2014 A Survey\u201d, BIT, 25, pp. 2\u201323, 1985.","journal-title":"BIT"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, \u201cNC-algorithms for Graphs with Small Treewidth\u201d, Proc. 14th WG'88, LNCS 344, Springer-Verlag, pp.1\u201310, 1989.","DOI":"10.1007\/3-540-50728-0_32"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, \u201cA Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth\u201d, Proc. 25th ACM STOC, pp.226\u2013234, 1993.","DOI":"10.1145\/167088.167161"},{"issue":"No.1\u20132","key":"26_CR6","first-page":"1","volume":"11","author":"H. Bodlaender","year":"1993","unstructured":"H. Bodlaender, \u201cA Tourist Guide through Treewidth\u201d, Acta Cybernetica, Vol. 11, No.1\u20132, pp. 1\u201321, 1993.","journal-title":"Acta Cybernetica"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri and C. Zaroliagis, \u201cShortest Path Queries in Digraphs of Small Treewidth\u201d, Proc. 22nd Int. Col. on Automata, Languages and Prog. (ICALP'95), LNCS 944, Springer-Verlag, pp. 244\u2013255.","DOI":"10.1007\/3-540-60084-1_78"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle, \u201cComputing on a Free Tree via Complexity-Preserving Mappings\u201d, Algorithmica, 2, pp. 337\u2013361, 1987.","journal-title":"Algorithmica"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, T. Hagerup and K. Mehlhorn, \u201cCan a maximum flow be computed on o(nm) time?\u201d, Proc. 17th Intl. Col. on Automata, Languages and Prog. (ICALP'90), LNCS 443, Sringer-Verlag, pp.235\u2013248, 1990.","DOI":"10.1007\/BFb0032035"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"H. Djidjev, G. Pantziou and C. Zaroliagis, \u201cOn-line and Dynamic Algorithms for Shortest Path Problems\u201d, Proc. 12th Symp. on Theor. Aspects of Comp. Sc. (STACS'95), LNCS 900, Springer-Verlag, pp.193\u2013204, 1995.","DOI":"10.1007\/3-540-59042-0_73"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"L.R. Ford and D.R. Fulkerson, \u201cMaximal flow through a network\u201d, Canadian Journal of Mathematics, 8, pp. 399\u2013404, 1956.","journal-title":"Canadian Journal of Mathematics"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, \u201cUsing Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems\u201d, Proc. 30th Annual IEEE Symp. on FOCS, 1989, pp.448\u2013453.","DOI":"10.1109\/SFCS.1989.63517"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, \u201cSearching among Intervals and Compact Routing Tables\u201d, Proc. 20th Int. Col. on Automata, Languages and Prog. (ICALP'93), LNCS 700, Springer-Verlag, pp.28\u201339, 1993.","DOI":"10.1007\/3-540-56939-1_59"},{"key":"26_CR14","unstructured":"T. Hagerup, J. Katajainen, N. Nishimura and P. Ragde, \u201cCharacterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees\u201d, Proc. 6th ACM-SIAM Symp. on Discr. Alg. (SODA'95), pp.641\u2013649, 1995."},{"key":"26_CR15","first-page":"551","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"R.E. Gomory and T.C. Hu, \u201cMulti-terminal network flows\u201d, Journal of SIAM, 9, pp. 551\u2013570, 1961.","journal-title":"Journal of SIAM"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"D.D. Sleator and R.E. Tarjan, \u201cA Data Structure for Dynamic Trees\u201d, Journal of Computer and System Sciences, 26, pp. 362\u2013391, 1983.","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"K. Weihe, \u201cMaximum (s,t)-Flows in Planar Networks in O(\u00a6V\u00a6log \u00a6V\u00a6) Time\u201d, Proc. 35th Annual IEEE Symp. on FOCS, 1994, pp.178\u2013189.","DOI":"10.1109\/SFCS.1994.365695"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60692-0_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:08:04Z","timestamp":1742598484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60692-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606925","9783540492634"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60692-0_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}