{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:08:20Z","timestamp":1743088100986,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692438"},{"type":"electronic","value":"9783030692445"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-69244-5_34","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:36:12Z","timestamp":1613838972000},"page":"379-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Algorithm of Isolated Toughness for Interval Graphs"],"prefix":"10.1007","author":[{"given":"Fengwei","family":"Li","sequence":"first","affiliation":[]},{"given":"Qingfang","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Hajo","family":"Broersma","sequence":"additional","affiliation":[]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J., Murty, U.: Graph Theory with Applications. Macmillan, London and Elsevier, New york (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1002\/jgt.21832","volume":"79","author":"H Broersma","year":"2015","unstructured":"Broersma, H., Fiala, J., Golovach, P., Kaiser, T., Paulusma, D., Proskurowski, A.: Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. J. Graph Theor. 79(4), 282\u2013299 (2015)","journal-title":"J. Graph Theor."},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-54029-6_157","volume-title":"Advances in Computing and Information \u2014 ICCI 1991","author":"MC Carlisle","year":"1991","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol. 497, pp. 90\u2013101. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54029-6_157"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and hamiltonian circuits. Discrete Math. 5, 215\u2013228 (1973)","journal-title":"Discrete Math."},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/jgt.3190090106","volume":"9","author":"H Enomoto","year":"1985","unstructured":"Enomoto, H., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence of $$k$$-factors. J. Graph Theor. 9, 87\u201395 (1985)","journal-title":"J. Graph Theor."},{"key":"34_CR7","volume-title":"Automatic Storage Optimization","author":"J Fabri","year":"1982","unstructured":"Fabri, J.: Automatic Storage Optimization. UMI Press Ann Arbor, MI (1982)"},{"issue":"99","key":"34_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P Gilmore","year":"1964","unstructured":"Gilmore, P., Hoffman, A.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16(99), 539\u2013548 (1964)","journal-title":"Can. J. Math."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0303-2647(82)90010-7","volume":"15","author":"J Jungck","year":"1982","unstructured":"Jungck, J., Dick, O., Dick, A.: Computer assisted sequencing, interval graphs and molecular evolution. Biosystem 15, 259\u2013273 (1982)","journal-title":"Biosystem"},{"issue":"3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T Kloks","year":"1998","unstructured":"Kloks, T., Kratschz, D.: Listing all minimal separators of a graph. SIAM J. Comput. 27(3), 605\u2013613 (1998)","journal-title":"SIAM J. Comput."},{"key":"34_CR12","unstructured":"Kloks, A.J.J., Kratsch, D., Spinrad, J.P.: Treewidth and pathwidth of co comparability graphs of bounded dimension. Computing Science Note. Eindhoven University of Technology, Eindhoven, The Netherlands 9346 (1993)"},{"key":"34_CR13","unstructured":"Kratsch, D., Klocks, T., M\u00fcller, H.: Computing the toughness and the scattering number for interval and other graphs. IRISA resarch report. France (1994)"},{"issue":"5","key":"34_CR14","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.camwa.2007.02.006","volume":"54","author":"F Li","year":"2007","unstructured":"Li, F., LI, X.: Neighbor-scattering number can be computed in polynomial time for interval graphs. Comput. Math. Appl. 54(5), 679\u2013686 (2007)","journal-title":"Comput. Math. Appl."},{"key":"34_CR15","first-page":"133","volume":"62","author":"Y Ma","year":"2003","unstructured":"Ma, Y., Liu, G.: Isolated toughness and the existence of fractional factors in graphs. Acta Appl. Math. Sinica (in Chinese) 62, 133\u2013140 (2003)","journal-title":"Acta Appl. Math. Sinica (in Chinese)"},{"issue":"1","key":"34_CR16","first-page":"188","volume":"19","author":"Y Ma","year":"2006","unstructured":"Ma, Y., Liu, G.: Fractional factors and isolated toughness of graphs. Mathematica Applicata 19(1), 188\u2013194 (2006)","journal-title":"Mathematica Applicata"},{"key":"34_CR17","first-page":"153","volume":"93","author":"Y Ma","year":"2009","unstructured":"Ma, Y., Wang, A., Li, J.: Isolated toughness and fractional $$(g, f)$$-factors of graphs. Ars Comb. 93, 153\u2013160 (2009)","journal-title":"Ars Comb."},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-70666-3_13","volume-title":"Discrete Geometry, Combinatorics and Graph Theory","author":"Y Ma","year":"2007","unstructured":"Ma, Y., Yu, Q.: Isolated toughness and existence of f-factors. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol. 4381, pp. 120\u2013129. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70666-3_13"},{"key":"34_CR19","first-page":"1","volume":"62","author":"Y Ma","year":"2007","unstructured":"Ma, Y., Yu, Q.: Isolated toughness and existence of $$[a, b]$$-factors in graphs. J. Combin. Math. Combin. Comput. 62, 1\u201312 (2007)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/TCS.1979.1084695","volume":"26","author":"T Ohtsuki","year":"1979","unstructured":"Ohtsuki, T., Mori, H., Khu, E., Kashiwabara, T., Fujisawa, T.: One dimensional logic gate assignment and interval graph. IEEE Trans. Circ. Syst. 26, 675\u2013684 (1979)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"34_CR21","volume-title":"Fractional Graph Theory","author":"ER Scheinerman","year":"1997","unstructured":"Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory. John Wiley and Son Inc., New York (1997)"},{"issue":"4","key":"34_CR22","first-page":"385","volume":"16","author":"J Yang","year":"2001","unstructured":"Yang, J., Ma, Y., Liu, G.: fractional $$(g, f)$$-factor in graphs. Acta Mathematica Scientia 16(4), 385\u2013390 (2001)","journal-title":"Acta Mathematica Scientia"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69244-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:49:36Z","timestamp":1613839776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69244-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692438","9783030692445"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69244-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcc.siat.ac.cn\/meeting\/pdcat-paap2020\/index.html","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","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":"34","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":"31% - 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":"3","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":"6","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)"}}]}}