{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:26:52Z","timestamp":1742970412870,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811995811"},{"type":"electronic","value":"9789811995828"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-9582-8_17","type":"book-chapter","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T17:36:46Z","timestamp":1675964206000},"page":"192-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partition-Edge Fault-Tolerant Hamiltonicity of\u00a0Pancake Graphs"],"prefix":"10.1007","author":[{"given":"Kun","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Hongbin","family":"Zhuang","sequence":"additional","affiliation":[]},{"given":"Xiao-Yan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fangying","family":"Song","sequence":"additional","affiliation":[]},{"given":"Lichao","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"issue":"21","key":"17_CR1","doi-asserted-by":"crossref","first-page":"10406","DOI":"10.1016\/j.amc.2012.03.092","volume":"218","author":"S-L Peng","year":"2012","unstructured":"Peng, S.-L., Lin, C.-K., Tan, J.J.M., Hsu, L.-H.: The g-good-neighbor conditional diagnosability of hypercube under PMC model. Appl. Math. Comput. 218(21), 10406\u201310412 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555\u2013565 (1989)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"17_CR3","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/0167-8191(94)00096-S","volume":"21","author":"A Kanevsky","year":"1995","unstructured":"Kanevsky, A., Feng, C.: On the embedding of cycles in pancake graphs. Parallel Comput. 21(6), 923\u2013936 (1995)","journal-title":"Parallel Comput."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"WH Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discret. Math. 27(1), 47\u201357 (1979)","journal-title":"Discret. Math."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Liu, W., Lin, C.-K.: Diagnosability and diagnostic algorithm for pancake graph under the comparison model. J. Interconnect. Netw. 15(1\u20132), 1550005:1\u20131550005:15 (2015)","DOI":"10.1142\/S021926591550005X"},{"issue":"1","key":"17_CR6","first-page":"91","volume":"59","author":"S Song","year":"2015","unstructured":"Song, S., Zhou, S., Li, X.-Y.: Conditional diagnosability of burnt pancake networks under the PMC model. Comput. J. 59(1), 91\u2013105 (2015)","journal-title":"Comput. J."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2015.03.027","volume":"582","author":"S Song","year":"2015","unstructured":"Song, S., Li, X.-Y., Zhou, S., Chen, M.: Fault tolerance and diagnosability of burnt pancake networks under the comparison model. Theor. Comput. Sci. 582, 48\u201359 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Chang, N.-W., Wu, H.-J., Hsieh, S.-Y.: Pancake graphs: structural properties and conditional diagnosability. J. Comb. Optim. (2022). https:\/\/doi.org\/10.1007\/s10878-022-00877-8","DOI":"10.1007\/s10878-022-00877-8"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2022.03.002","volume":"916","author":"N Wang","year":"2022","unstructured":"Wang, N., Meng, J., Tian, Y.: Neighbor-connectivity of pancake networks and burnt pancake networks. Theor. Comput. Sci. 916, 31\u201339 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.dam.2022.09.013","volume":"324","author":"M-M Gu","year":"2023","unstructured":"Gu, M.-M., Chang, J.-M.: Neighbor connectivity of pancake graphs and burnt pancake graphs. Discret. Appl. Math. 324, 46\u201357 (2023)","journal-title":"Discret. Appl. Math."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2019.10.018","volume":"279","author":"M-M Gu","year":"2020","unstructured":"Gu, M.-M., Hao, R.-X., Tang, S.-M., Chang, J.-M.: Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Discret. Appl. Math. 279, 80\u201391 (2020)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2005.02.007","volume":"339","author":"C-K Lin","year":"2005","unstructured":"Lin, C.-K., Huang, H.-M., Hsu, L.-H.: The super connectivity of the pancake graphs and the super laceability of the star graphs. Theor. Comput. Sci. 339(2), 257\u2013271 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"17_CR13","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1007\/s00373-016-1679-x","volume":"32","author":"E Konstantinova","year":"2016","unstructured":"Konstantinova, E., Medvedev, A.: Independent even cycles in the pancake graph and greedy prefix-reversal gray codes. Graphs Comb. 32(5), 1965\u20131978 (2016)","journal-title":"Graphs Comb."},{"issue":"17","key":"17_CR14","doi-asserted-by":"publisher","first-page":"5474","DOI":"10.1016\/j.disc.2008.12.023","volume":"309","author":"C-K Lin","year":"2009","unstructured":"Lin, C.-K., Tan, J.J.M., Huang, H.-M., Hsu, D.F., Hsu, L.-H.: Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs. Discret. Math. 309(17), 5474\u20135483 (2009)","journal-title":"Discret. Math."},{"issue":"5","key":"17_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0020-0190(02)00510-0","volume":"86","author":"C-N Hung","year":"2003","unstructured":"Hung, C.-N., Hsu, H.-C., Liang, K.-Y., Hsu, L.-H.: Ring embedding in faulty pancake graphs. Inf. Process. Lett. 86(5), 271\u2013275 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.tcs.2008.09.015","volume":"409","author":"P-Y Tsai","year":"2008","unstructured":"Tsai, P.-Y., Fu, J.-S., Chen, G.-H.: Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model. Theor. Comput. Sci. 409(3), 450\u2013460 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s11227-020-03297-9","volume":"77","author":"K-J Pai","year":"2021","unstructured":"Pai, K.-J., Chang, R.-S., Chang, J.-M.: Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks. J. Supercomput. 77(1), 990\u20131014 (2021)","journal-title":"J. Supercomput."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"16679","DOI":"10.1109\/ACCESS.2021.3049290","volume":"9","author":"Y-C Yang","year":"2021","unstructured":"Yang, Y.-C., Kao, S.-S., Klasing, R., Hsieh, S.-Y., Chou, H.-H., Chang, J.-M.: The construction of multiple independent spanning trees on burnt pancake networks. IEEE Access 9, 16679\u201316691 (2021)","journal-title":"IEEE Access"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"3427","DOI":"10.1109\/ACCESS.2019.2962549","volume":"8","author":"D-W Cheng","year":"2020","unstructured":"Cheng, D.-W., Chan, C.-T., Hsieh, S.-Y.: Constructing independent spanning trees on pancake networks. IEEE Access 8, 3427\u20133433 (2020)","journal-title":"IEEE Access"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.ins.2007.08.012","volume":"178","author":"J Fan","year":"2008","unstructured":"Fan, J., Jia, X.: Edge-pancyclicity and path-embeddability of bijective connection graphs. Inf. Sci. 178(2), 340\u2013351 (2008)","journal-title":"Inf. Sci."},{"key":"17_CR21","volume-title":"Parallel Computation: Models and Methods","author":"SG Akl","year":"1997","unstructured":"Akl, S.G.: Parallel Computation: Models and Methods. Prentice Hall, Upper Saddle River (1997)"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1109\/TC.2012.255","volume":"63","author":"M Ebrahimi","year":"2014","unstructured":"Ebrahimi, M., Daneshtalab, M., Liljeberg, P., Plosila, J., Flich, J., Tenhunen, H.: Path-based partitioning methods for 3D networks-on-chip with minimal adaptive routing. IEEE Trans. Comput. 63(3), 718\u2013733 (2014)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(01)00256-3","volume":"82","author":"J Fan","year":"2002","unstructured":"Fan, J.: Hamilton-connectivity and cycle-embedding of the M\u00f6bius cubes. Inf. Process. Lett. 82(2), 113\u2013117 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"17_CR24","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1109\/TPDS.2014.2350480","volume":"26","author":"L-C Ye","year":"2015","unstructured":"Ye, L.-C., Liang, J.-R.: Five-round adaptive diagnosis in Hamiltonian networks. IEEE Trans. Parallel Distrib. Syst. 26(9), 2459\u20132464 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"17_CR25","doi-asserted-by":"publisher","first-page":"2944","DOI":"10.1093\/comjnl\/bxv019","volume":"58","author":"X Wang","year":"2015","unstructured":"Wang, X., Erickson, A., Fan, J., Jia, X.: Hamiltonian properties of DCell networks. Comput. J. 58(11), 2944\u20132955 (2015)","journal-title":"Comput. J."},{"issue":"3","key":"17_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/71.755822","volume":"10","author":"S-Y Hsieh","year":"1999","unstructured":"Hsieh, S.-Y., Chen, G.-H., Ho, C.-W.: Fault-free Hamiltonian cycles in faulty arrangement graphs. IEEE Trans. Parallel Distrib. Syst. 10(3), 223\u2013237 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"17_CR27","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1006\/jpdc.2001.1813","volume":"62","author":"W-T Huang","year":"2002","unstructured":"Huang, W.-T., Tan, J.J.M., Hung, C.-N., Hsu, L.-H.: Fault-tolerant Hamiltonicity of twisted cubes. J. Parallel Distrib. Comput. 62(4), 591\u2013604 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ins.2014.12.026","volume":"300","author":"Q Zhou","year":"2015","unstructured":"Zhou, Q., Chen, D., L\u00fc, H.: Fault-tolerant Hamiltonian laceability of balanced hypercubes. Inf. Sci. 300, 20\u201327 (2015)","journal-title":"Inf. Sci."},{"issue":"3","key":"17_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-020-9387-3","volume":"15","author":"W Fan","year":"2021","unstructured":"Fan, W., Fan, J., Han, Z., Li, P., Zhang, Y., Wang, R.: Fault-tolerant Hamiltonian cycles and paths embedding into locally exchanged twisted cubes. Front. Comput. Sci. 15(3), 1\u201316 (2021)","journal-title":"Front. Comput. Sci."},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ic.2016.10.002","volume":"251","author":"S-Y Hsieh","year":"2016","unstructured":"Hsieh, S.-Y., Lee, C.-W., Huang, C.-H.: Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks. Inf. Comput. 251, 314\u2013334 (2016)","journal-title":"Inf. Comput."},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"80908","DOI":"10.1109\/ACCESS.2020.2990652","volume":"8","author":"C-N Kuo","year":"2020","unstructured":"Kuo, C.-N., Cheng, Y.-H.: Hamiltonian cycle in folded hypercubes with highly conditional edge faults. IEEE Access 8, 80908\u201380913 (2020)","journal-title":"IEEE Access"},{"issue":"12","key":"17_CR32","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.ipl.2009.02.008","volume":"109","author":"T-Y Ho","year":"2009","unstructured":"Ho, T.-Y., Shih, Y.-K., Tan, J.J.M., Hsu, L.-H.: Conditional fault Hamiltonian connectivity of the complete graph. Inf. Process. Lett. 109(12), 585\u2013588 (2009)","journal-title":"Inf. Process. Lett."}],"container-title":["Communications in Computer and Information Science","New Trends in Computer Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-9582-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T15:58:55Z","timestamp":1701878335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-9582-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811995811","9789811995828"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-9582-8_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taoyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incosy2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics2022.ntub.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ICS 2022 includes one invited paper","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}