{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:03:42Z","timestamp":1743109422334,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030624590"},{"type":"electronic","value":"9783030624606"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62460-6_2","type":"book-chapter","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:03:00Z","timestamp":1605002580000},"page":"12-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Variant of Sun Toughness and the Existence of Path Factors in Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7044-4860","authenticated-orcid":false,"given":"Linli","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4085-3625","authenticated-orcid":false,"given":"Haci Mehmet","family":"Baskonus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7963-3502","authenticated-orcid":false,"given":"Wei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"issue":"1","key":"2_CR1","first-page":"167","volume":"14","author":"S Zhou","year":"2019","unstructured":"Zhou, S., Sun, Z., Liu, H.: Sun touthness and $$P_{\\ge 3}$$-factors in graphs. Contrib. Disc. Math. 14(1), 167\u2013174 (2019)","journal-title":"Contrib. Disc. Math."},{"key":"2_CR2","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. Disc. Math. 5, 215\u2013228 (1973)","journal-title":"Disc. Math."},{"key":"2_CR3","first-page":"385","volume":"16","author":"JB Yang","year":"2001","unstructured":"Yang, J.B., Ma, Y.H., Liu, G.Z.: Fractional $$(g, f)$$-factors in graphs. Appl. Math.- J. Chin. Univ. Ser. A 16, 385\u2013390 (2001)","journal-title":"Appl. Math.- J. Chin. Univ. Ser. A"},{"key":"2_CR4","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 Theory 9, 87\u201395 (1985)","journal-title":"J. Graph Theory"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0012-365X(98)00059-4","volume":"189","author":"H Enomoto","year":"1998","unstructured":"Enomoto, H.: Toughness and the existence of $$k$$-factors II. Disc. Math. 189, 277\u2013282 (1998)","journal-title":"Disc. Math."},{"issue":"1","key":"2_CR6","first-page":"88","volume":"21","author":"L Zhang","year":"2001","unstructured":"Zhang, L., Liu, G.: Fractional $$k$$-factor of graphs. J. Syst. Sci. Math. Sci. 21(1), 88\u201392 (2001)","journal-title":"J. Syst. Sci. Math. Sci."},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0095-8956(03)00027-3","volume":"88","author":"A Kaneko","year":"2003","unstructured":"Kaneko, A.: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Comb. Theory Ser. B 88(2), 195\u2013218 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1016\/j.disc.2008.04.022","volume":"309","author":"H Zhang","year":"2009","unstructured":"Zhang, H., Zhou, S.: Characterizations for $$P_{\\ge 2}$$-factor and $$P_{\\ge 3}$$-factor covered graphs. Disc. Math. 309, 2067\u20132076 (2009)","journal-title":"Disc. Math."},{"issue":"9","key":"2_CR9","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.2298\/FIL1909735G","volume":"33","author":"W Gao","year":"2019","unstructured":"Gao, W., Wang, W., Dimitrov, D.: Toughness condition for a graph to be all fractional $$(g, f, n)$$-critical deleted. Filomat 33(9), 2735\u20132746 (2019)","journal-title":"Filomat"},{"issue":"7","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s10114-019-8169-z","volume":"35","author":"W Gao","year":"2019","unstructured":"Gao, W., Guirao, J.L.G., Chen, Y.: A toughness condition for fractional $$(k, m)$$-deleted graphs revisited. Acta Math. Sinica Engl. Ser. 35(7), 1227\u20131237 (2019)","journal-title":"Acta Math. Sinica Engl. Ser."},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13660-019-2106-7","volume":"2019","author":"W Gao","year":"2019","unstructured":"Gao, W., Guirao, J.L.G.: Parameters and fractional factors in different settings. J. Inequalities Appl. 2019(1), 1\u201316 (2019). https:\/\/doi.org\/10.1186\/s13660-019-2106-7","journal-title":"J. Inequalities Appl."},{"issue":"4\u20135","key":"2_CR12","doi-asserted-by":"publisher","first-page":"877","DOI":"10.3934\/dcdss.2019058","volume":"12","author":"W Gao","year":"2019","unstructured":"Gao, W., Guirao, J.L.G., Abdel-Aty, M., Xi, W.: An independent set degree condition for fractional critical deleted graphs. Disc. Continuous Dyn. Syst.-Ser. S 12(4\u20135), 877\u2013886 (2019)","journal-title":"Disc. Continuous Dyn. Syst.-Ser. S"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12346-016-0222-z","volume":"17","author":"W Gao","year":"2018","unstructured":"Gao, W., Guirao, J.L.G., Wu, H.: Two tight independent set conditions for fractional $$(g, f, m)$$-deleted graphs systems. Qual. Theory Dyn. Syst. 17(1), 231\u2013243 (2018)","journal-title":"Qual. Theory Dyn. Syst."}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62460-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:23:54Z","timestamp":1605003834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62460-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030624590","9783030624606"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62460-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ML4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"8 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ml4cs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ml4cs2020\/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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"360","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":"118","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":"40","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":"33% - 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.2","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":"8","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)"}}]}}