{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:32:37Z","timestamp":1742974357620,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319685267"},{"type":"electronic","value":"9783319685274"}],"license":[{"start":{"date-parts":[[2017,9,24]],"date-time":"2017-09-24T00:00:00Z","timestamp":1506211200000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-68527-4_12","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T02:39:20Z","timestamp":1506134360000},"page":"109-116","source":"Crossref","is-referenced-by-count":0,"title":["Graph Theory Modeling \u2013 A Petri Nets Based\u00a0Approach"],"prefix":"10.1007","author":[{"given":"Shi-Jian","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing-Si","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s100090100058","volume":"3","author":"H Genrich","year":"2001","unstructured":"Genrich, H., K\u00fcffner, R., Voss, K.: Executable Petri net models for the analysis of metabolic pathways. Int. J. Softw. Tools Technol. Transf. 3(4), 394\u2013404 (2001). doi:\n10.1007\/s100090100058","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"4","key":"12_CR2","first-page":"74","volume":"22","author":"HC Hua","year":"2000","unstructured":"Hua, H.C., Hai, C.X.: A top-to-down method getting the systems minimal cut sets by Petri net. Syst. Eng. Electron. 22(4), 74\u201376 (2000)","journal-title":"Syst. Eng. Electron."},{"issue":"5","key":"12_CR3","first-page":"63","volume":"28","author":"ZY Fa","year":"2007","unstructured":"Fa, Z.Y., Qi, C., Wen, Z.X.: Using Petri nets model to improve the algorithm of MCS solution. Nucl. Power Eng. 28(5), 63\u201368 (2007)","journal-title":"Nucl. Power Eng."},{"issue":"8","key":"12_CR4","first-page":"1273","volume":"25","author":"LL Yan","year":"2010","unstructured":"Yan, L.L., Ping, W.X., Xin, T.S.: Assessment method of system reliability for stochastic flow network based on rough sets theory and Petri nets. Control Decis. 25(8), 1273\u20131276 (2010)","journal-title":"Control Decis."},{"issue":"1","key":"12_CR5","first-page":"27","volume":"32","author":"HX Ying","year":"2010","unstructured":"Ying, H.X., Bin, H., Long, Z.J., Yin, L.T., Yin, J.G.: Concurrent approach to the max flow of network based on Petri net. J. WUT (Inf. Manag. Eng.) 32(1), 27\u201330 (2010)","journal-title":"J. WUT (Inf. Manag. Eng.)"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00371-015-1076-0","volume":"32","author":"R Pan","year":"2016","unstructured":"Pan, R., Taubin, G.: Automatic segmentation of point clouds from multi-view reconstruction using graph-cut. Vis. Comput. 32(5), 601\u2013609 (2016). doi:\n10.1007\/s00371-015-1076-0","journal-title":"Vis. Comput."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1111\/j.1467-8659.2011.01895.x","volume":"30","author":"L Fan","year":"2011","unstructured":"Fan, L., Lic, L., Liu, K.: Paint mesh cutting. Comput. Graph. Forum 30(2), 603\u2013612 (2011). doi:\n10.1111\/j.1467-8659.2011.01895.x","journal-title":"Comput. Graph. Forum"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Liu, L., Sheng, Y., Zhang, G., Ugail, H.: Graph cut based mesh segmentation using feature points and geodesic distance. In: 2015 International Conference on Cyberworlds (CW), pp. 115\u2013120. IEEE Computer Society, Los Alamitos (2015). \ndoi.ieeecomputersociety.org\/10.1109\/CW.2015.31","DOI":"10.1109\/CW.2015.31"},{"issue":"6","key":"12_CR9","first-page":"912","volume":"38","author":"ST Liu","year":"2012","unstructured":"Liu, S.T., Yin, F.L.: The basic principle and its new advances of image segmentation methods based on graph cuts. Acta Automatica Sinica 38(6), 912\u2013922 (2012)","journal-title":"Acta Automatica Sinica"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/TIP.2014.2378060","volume":"24","author":"Y Peng","year":"2015","unstructured":"Peng, Y., Chen, L., Ou-Yang, F.X., Chen, W., Yong, J.H.: Jf-cut: a parallel graph cut approach for large-scale image and video. IEEE Trans. Image Process. 24(2), 655\u2013666 (2015). doi:\n10.1109\/TIP.2014.2378060","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"12_CR11","first-page":"284","volume":"44","author":"XH Yan","year":"2009","unstructured":"Yan, X.H., Lin, Z., Bo, Y.: Optimization of road network structure based on maximum-flow theory. J. Southwest Jiaotong Univ. 44(2), 284\u2013288 (2009)","journal-title":"J. Southwest Jiaotong Univ."},{"issue":"1","key":"12_CR12","first-page":"118","volume":"44","author":"KW Hua","year":"2009","unstructured":"Hua, K.W., Ping, L.Z.: Maximum flow assignment algorithm for transshipment nodes with flow demands in transportation network. J. Southwest Jiaotong Univ. 44(1), 118\u2013121 (2009)","journal-title":"J. Southwest Jiaotong Univ."},{"issue":"4","key":"12_CR13","first-page":"544","volume":"29","author":"ZX Chao","year":"2006","unstructured":"Chao, Z.X., He, J., Liang, C.G.: Minimum cuts and maximum flows in directed planar networks with both node and edge capacities. Chin. J. Comput. 29(4), 544\u2013551 (2006)","journal-title":"Chin. J. Comput."},{"key":"12_CR14","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"12_CR15","volume-title":"Algorithms in C, Part 5: Graph Algorithms","author":"R Sedgewick","year":"2001","unstructured":"Sedgewick, R.: Algorithms in C, Part 5: Graph Algorithms, 3rd edn. Addison-Wesley Professional, Boston (2001)","edition":"3"},{"key":"12_CR16","unstructured":"Yi, Y.C.: Principle & Applications of Petri Nets. Publishing House of Electronics Industry (2005)"},{"key":"12_CR17","first-page":"1","volume":"40","author":"LS Jian","year":"2009","unstructured":"Jian, L.S., Bo, Y.X., Zheng, Z.: Additional theorem proving and analysis of s-complement in the Petri net. J. Syst. Simul. 40, 1\u20135 (2009)","journal-title":"J. Syst. Simul."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68527-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T06:09:25Z","timestamp":1506492565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68527-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,24]]},"ISBN":["9783319685267","9783319685274"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68527-4_12","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,9,24]]}}}