{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:50:00Z","timestamp":1743025800421,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319298160"},{"type":"electronic","value":"9783319298177"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29817-7_6","type":"book-chapter","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T00:46:18Z","timestamp":1454460378000},"page":"54-66","source":"Crossref","is-referenced-by-count":0,"title":["Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Sl\u00e1me\u010dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"B\u00edl, M., Vod\u00e1k, R., Hlin\u011bn\u00fd, P., Svoboda, T., Rebok, T.: A novel method for rapid identification of road links causing network break-up, submitted to EJOR (2015)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Chhugani, J., Satish, N., Kim, C., Sewall, J., Dubey, P.: Fast and efficient graph traversal algorithm for CPUs: Maximizing single-node efficiency. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium. IEEE, May 2012. \n                    http:\/\/dx.org\/10.1109\/IPDPS.2012.43","DOI":"10.1109\/IPDPS.2012.43"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994). \n                    http:\/\/dx.doi.org\/10.1137\/S0097539792225297","journal-title":"SIAM J. Comput."},{"key":"6_CR4","unstructured":"Dinic, E., Karzanov, A., Lomonosov, M.: A structure of the system of all minimum cuts of a graph. In: Fridman, A.A. (ed.) Studies in Discrete Optimization, Nauka, Moscow, pp. 290\u2013306 (in Russian) (1976)"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"BD McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306\u2013324 (1998). \n                    http:\/\/dx.org\/10.1006\/jagm.1997.0898","journal-title":"J. Algorithms"},{"key":"6_CR6","series-title":"Oxford graduate texts in mathematics","volume-title":"Matroid Theory","author":"J Oxley","year":"2006","unstructured":"Oxley, J.: Matroid Theory. Oxford graduate texts in mathematics. Oxford University Press, New York, USA (2006). \n                    http:\/\/books.google.cz\/books?id=puKta1Hdz-8C"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"JS Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777\u2013788 (1983). \n                    http:\/\/dx.org\/10.1137\/0212053","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2009.07.001","volume":"7","author":"G Reinelt","year":"2010","unstructured":"Reinelt, G., Wenger, K.M.: Generating partitions of a graph into a fixed number of minimum weight cuts. Discrete Optim. 7(1\u20132), 1\u201312 (2010). \n                    http:\/\/dx.org\/10.1016\/j.disopt.2009.07.001","journal-title":"Discrete Optim."}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29817-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:06:49Z","timestamp":1559380009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29817-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319298160","9783319298177"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29817-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}