{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:42:20Z","timestamp":1726044140519},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030312534"},{"type":"electronic","value":"9783030312541"}],"license":[{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-31254-1_9","type":"book-chapter","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T05:22:22Z","timestamp":1568092942000},"page":"65-72","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Grishkevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,11]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2015.07.035","volume":"248","author":"K Otsukia","year":"2016","unstructured":"Otsukia, K., Kobayashib, Y., Murota, K.: Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network. Eur. J. Oper. Res. 248, 396\u2013403 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s11554-013-0344-3","volume":"11","author":"B Fishbain","year":"2016","unstructured":"Fishbain, B., Hochbaum, D.S., Mueller, S.: A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications. J. Real-Time Image Proc. 11(3), 589\u2013609 (2016)","journal-title":"J. Real-Time Image Proc."},{"key":"9_CR3","unstructured":"Gianinazzi, L., Kalvoda, P., Palma, A., et al.: Communication-avoiding parallel minimum cuts and connected components. In: ACM Conference Principles and Practice of Parallel Programming 2018, PPoPP 2018 (2018). http:\/\/www.unixer.de\/~htor\/publications"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.bspc.2019.04.008","volume":"52","author":"W Sun","year":"2019","unstructured":"Sun, W., Dong, E.: Kullback-Leibler distance and graph cuts based active contour model for local segmentation. Biomed. Sig. Process. Control 52, 120\u2013127 (2019)","journal-title":"Biomed. Sig. Process. Control"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.eswa.2019.01.055","volume":"126","author":"Z Liu","year":"2019","unstructured":"Liu, Z., Song, Y.Q., Sheng, V.S., et al.: Liver CT sequence segmentation based with improved U-Net and graph cut. Expert Syst. Appl. 126, 54\u201363 (2019)","journal-title":"Expert Syst. Appl."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1002\/qre.1772","volume":"32","author":"R Mishra","year":"2016","unstructured":"Mishra, R., Saifi, M.A., Chaturvedi, S.K.: Enumeration of minimal cutsets for directed networks with comparative reliability study for paths or cuts. Qual. Reliab. Engng. Int. 32, 555\u2013565 (2016)","journal-title":"Qual. Reliab. Engng. Int."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ijepes.2014.04.023","volume":"62","author":"A Emadi","year":"2014","unstructured":"Emadi, A., Afrakhte, H.: A novel and fast algorithm for locating minimal cuts up to second order of undirected graphs with multiple sources and sinks. Electr. Power Energy Syst. 62, 95\u2013102 (2014)","journal-title":"Electr. Power Energy Syst."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11803-012-0093-5","volume":"11","author":"W Liu","year":"2012","unstructured":"Liu, W., Li, J.: An improved cut-based recursive decomposition algorithm for reliability analysis of networks. Earthq. Eng. Eng. Vib. 11, 1\u201310 (2012)","journal-title":"Earthq. Eng. Eng. Vib."},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"L Ford","year":"1962","unstructured":"Ford, L., Fullkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9_CR10","volume-title":"Integer Programming and Network Flows","author":"T Hu","year":"1969","unstructured":"Hu, T.: Integer Programming and Network Flows. Addison-Wesley, Reading (1969)"},{"key":"9_CR11","volume-title":"Combinatory Methods of Research of Extreme Structures of Mathematical Models of Electric Circuits and Systems","author":"AA Grishkevich","year":"2004","unstructured":"Grishkevich, A.A.: Combinatory Methods of Research of Extreme Structures of Mathematical Models of Electric Circuits and Systems. Publishing House JuUrGu, Chelyabinsk (2004)"},{"key":"9_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6666-3","volume-title":"Combinatorial Theory","author":"M Aigner","year":"1979","unstructured":"Aigner, M.: Combinatorial Theory. Springer, Heidelberg (1979)"}],"container-title":["Advances in Intelligent Systems and Computing","Image Processing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31254-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T19:55:01Z","timestamp":1611086101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31254-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,11]]},"ISBN":["9783030312534","9783030312541"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31254-1_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,9,11]]},"assertion":[{"value":"11 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IP&C","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Image Processing and Communications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bydgoszcz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icipc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ipc-conference.utp.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}