{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:42:10Z","timestamp":1725468130218},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055084","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"556-567","source":"Crossref","is-referenced-by-count":0,"title":["Computing mimicking networks"],"prefix":"10.1007","author":[{"given":"Shiva","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. V.","family":"Subrahmanyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"49_CR1","unstructured":"R. Ahuja, T. Magnanti, and J. Orlin, Network Flows Prentice-Hall, 1993."},{"key":"49_CR2","unstructured":"S. Arikati, S. Chaudhuri, and C. Zaroliagis, All-Pairs Min-Cut in Sparse Networks, Journal of Algorithms, to appear; preliminary version in Found. of Software Technology and Theor. Comp. Science-FSTTCS'95, Lecture Notes in Computer Science Vol. 1026, Springer-Verlag, 1995, pp.363\u2013376."},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"H. Bodlaender, A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth, SIAM Journal on Computing, 25 (1996), 1305\u20131317.","journal-title":"SIAM Journal on Computing"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01758845","volume":"8","author":"C.K. Cheng","year":"1992","unstructured":"C.K. Cheng and T.C. Hu, Maximum Concurrent Flows and Minimum Cuts, Algorithmica, 8 (1992), 233\u2013249.","journal-title":"Algorithmica"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"D. Gusfield, Very Simple Methods for All Pairs Network Flow Analysis, SIAM Journal on Computing, 19 (1990), 143\u2013155.","journal-title":"SIAM Journal on Computing"},{"key":"49_CR6","first-page":"551","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"R.E. Gomory and T.C. Hu, Multi-terminal network flows, Journal of SIAM, 9 (1961), 551\u2013570.","journal-title":"Journal of SIAM"},{"key":"49_CR7","unstructured":"T. Hagerup, J. Katajainen, N. Nishimura, and P. Ragde, Characterizations of k- Terminal Flow Networks and Computing Network Flows in Partial k-Trees, in Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA '95) ACM-SIAM, 1995, pp. 641\u2013649."},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(93)90115-P","volume":"45","author":"E. Ihler","year":"1993","unstructured":"E. Ihler, F. Wagner, and D. Wagner, Modeling hypergraphs by graphs with the same mincut properties, Inform. Proc. Lett., 45 (1993), 171\u2013175.","journal-title":"Inform. Proc. Lett."},{"key":"49_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Teubner, Stuttgart and Wiley, Chichester, UK, 1990."},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(86)90080-6","volume":"13","author":"M.T. Shing","year":"1986","unstructured":"M.T. Shing and T.C. Hu, A Decomposition Algorithm for Multi-terminal Network Flows, Discrete Applied Mathematics, 13 (1986), 165\u2013181.","journal-title":"Discrete Applied Mathematics"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/31.57601","volume":"37","author":"A. Vanneli","year":"1990","unstructured":"A. Vanneli and S.W. Hadley, A Gomory-Hu cut tree representation of a netlist partitioning problem, IEEE Trans. Circuits and Systems, 37 (1990), 1133\u20131139.","journal-title":"IEEE Trans. Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T14:03:01Z","timestamp":1587132181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0055084","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}