{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:15:51Z","timestamp":1743038151783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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-75172-6_8","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"80-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Network Algorithms Based on Graph Decomposition"],"prefix":"10.1007","author":[{"given":"Manas Jyoti","family":"Kashyop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsunehiko","family":"Nagayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"8_CR1","unstructured":"Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report, Tel-Aviv University (1987)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.1998.0961","volume":"29","author":"SR Arikati","year":"1998","unstructured":"Arikati, S.R., Chaudhuri, S., Zaroliagis, C.D.: All-pairs min-cut in sparse networks. J. Algorithms 29, 82\u2013110 (1998)","journal-title":"J. Algorithms"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0097539792236730","volume":"24","author":"AA Bencz\u00far","year":"1995","unstructured":"Bencz\u00far, A.A.: Counterexamples for directed and node capacitated cut-trees. SIAM J. Comput. 24, 505\u2013510 (1995)","journal-title":"SIAM J. Comput."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.: An O$$ (n \\log n)$$ algorithm for maximum $$st$$-flow in a directed planar graph. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 524\u2013533 (2006)","DOI":"10.1145\/1109557.1109615"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s004539910003","volume":"20","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Subrahmanyam, K.V., Wagner, F., Zaroliagis, C.D.: Computing mimicking networks. Algorithmica 20, 31\u201349 (2000)","journal-title":"Algorithmica"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B Chazelle","year":"1987","unstructured":"Chazelle, B.: Computing on a free tree via complexity-preserving mappings. Algorithmica 2, 337\u2013361 (1987)","journal-title":"Algorithmica"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Using cellular graph embeddings in solving all pairs shortest paths problems. In: Proceedings of 30th Annual Symposium on Foundations of Computer Science, pp. 448\u2013453 (1989)","DOI":"10.1109\/SFCS.1989.63517"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35, 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9, 551\u2013570 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77\u201390. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44541-2_8"},{"key":"8_CR13","unstructured":"Hagerup, T., Katajainen, J., Nishimura, N., Radge, P.: Characterizations of $$k$$-terminal flow networks and computing network flows in partial $$k$$-trees. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641\u2013649 (1995)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"JX Hao","year":"1994","unstructured":"Hao, J.X., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17, 424\u2013446 (1994)","journal-title":"J. Algorithms"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16, 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Italiano, G.F., Nussbaum, Y., Sankowski, P., Wulff-Nilsen, C.: Improved algorithms for min cut and max flow in undirected planar graphs. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 313\u2013322 (2011)","DOI":"10.1145\/1993636.1993679"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.E.: A faster deterministic maximum flow algorithm. J. Algorithms 17, 447\u2013474 (1994)","journal-title":"J. Algorithms"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H Nagamochi","year":"1988","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. 5, 54\u201366 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in O$$(nm)$$ time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36, 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(86)90080-6","volume":"13","author":"MT Shing","year":"1986","unstructured":"Shing, M.T., Hu, T.C.: A decomposition algorithm for multi-terminal networks flows. Discrete Appl. Math. 13, 165\u2013181 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Application (2006). ISBN 9780198566076","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:39:36Z","timestamp":1710344376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}