{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:13:28Z","timestamp":1742930008586,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030622220"},{"type":"electronic","value":"9783030622237"}],"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-62223-7_44","type":"book-chapter","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:03:00Z","timestamp":1605002580000},"page":"511-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vulnerability Variants and Matching in Networks"],"prefix":"10.1007","author":[{"given":"Meihui","family":"Lan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7963-3502","authenticated-orcid":false,"given":"Wei","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"44_CR1","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. Discr. Math. 5, 215\u2013228 (1973)","journal-title":"Discr. Math."},{"key":"44_CR2","first-page":"385","volume":"16","author":"J Yang","year":"2001","unstructured":"Yang, J., Ma, Y., Liu, G.: 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":"44_CR3","doi-asserted-by":"crossref","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":"44_CR4","doi-asserted-by":"crossref","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. Discr. Math. 189, 277\u2013282 (1998)","journal-title":"Discr. Math."},{"issue":"1","key":"44_CR5","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."},{"key":"44_CR6","first-page":"13","volume-title":"Contemporary DesignTheory: A Collection of Surveys","author":"B Alspach","year":"1992","unstructured":"Alspach, B., Heinrich, K., Liu, G.: Orthogonal factorizations of graphs. In: Diuctz, J.H., Stinson, D.R. (eds.) Contemporary DesignTheory: A Collection of Surveys, pp. 13\u201337. Wiley, New York (1992)"},{"key":"44_CR7","doi-asserted-by":"publisher","unstructured":"Zhou, S.: Remarks on path factors in graphs. RAIRO Oper. Res. https:\/\/doi.org\/10.1051\/ro\/2019111","DOI":"10.1051\/ro\/2019111"},{"issue":"3","key":"44_CR8","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1051\/ro\/2017045","volume":"53","author":"S Zhou","year":"2019","unstructured":"Zhou, S.: Some results about component factors in graphs. RAIRO Oper. Res. 53(3), 723\u2013730 (2019)","journal-title":"RAIRO Oper. Res."},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Zhou, S., Wu, J., Zhang, T.: The existence of $$P_{\\ge 3}$$-factor covered graphs. Discussiones Mathematicae Graph Theor. 37(4), 1055\u20131065 (2017)","DOI":"10.7151\/dmgt.1974"},{"key":"44_CR10","doi-asserted-by":"publisher","unstructured":"Zhou, S., Yang, F., Xu, L.: Two sufficient conditions for the existence of path factors in graphs. Sci. Iranica (2019). https:\/\/doi.org\/10.24200\/SCI.2018.5151.1122","DOI":"10.24200\/SCI.2018.5151.1122"},{"issue":"8","key":"44_CR11","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10114-020-9224-5","volume":"36","author":"SZ Zhou","year":"2020","unstructured":"Zhou, S.Z., Sun, Z.R.: Some existence theorems on path factors with given properties in graphs. Acta Math. Sinica Eng. Ser. 36(8), 917\u2013928 (2020). https:\/\/doi.org\/10.1007\/s10114-020-9224-5","journal-title":"Acta Math. Sinica Eng. Ser."},{"issue":"9","key":"44_CR12","doi-asserted-by":"crossref","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":"44_CR13","doi-asserted-by":"crossref","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 Eng. Ser. 35(7), 1227\u20131237 (2019)","journal-title":"Acta Math. Sinica Eng. Ser."},{"issue":"1","key":"44_CR14","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. Inequal. Appl. 2019(1), 1\u201316 (2019). https:\/\/doi.org\/10.1186\/s13660-019-2106-7","journal-title":"J. Inequal. Appl."},{"issue":"4\u20135","key":"44_CR15","first-page":"877","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. Discrete Contin. Dyn. Syst. Ser. S 12(4\u20135), 877\u2013886 (2019)","journal-title":"Discrete Contin. Dyn. Syst. Ser. S"},{"issue":"1","key":"44_CR16","doi-asserted-by":"crossref","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. Theor. Dyn. Syst. 17(1), 231\u2013243 (2018)","journal-title":"Qual. Theor. Dyn. Syst."},{"key":"44_CR17","first-page":"55","volume":"7","author":"Q Yu","year":"1993","unstructured":"Yu, Q.: Characterizations of various matching extensions in graphs. Austr. J. Combinator. 7, 55\u201364 (1993)","journal-title":"Austr. J. Combinator."},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0012-365X(00)00328-9","volume":"231","author":"G Liu","year":"2001","unstructured":"Liu, G., Yu, Q.: Generalization of matching extensions in graphs. Discr. Math. 231, 311\u2013320 (2001)","journal-title":"Discr. Math."},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. London Math. Soc."},{"key":"44_CR20","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. Ann. Discr. Math. 29 (1986)"},{"issue":"3","key":"44_CR21","first-page":"1","volume":"21","author":"H Lu","year":"2019","unstructured":"Lu, H., Yu, Q.: Binding Number, toughness and general matching extendability in graphs. Discr. Math. Theor. Comput. Sci. 21(3), 1\u20138 (2019)","journal-title":"Discr. Math. Theor. Comput. Sci."},{"issue":"4","key":"44_CR22","first-page":"567","volume":"21","author":"Y Ma","year":"2004","unstructured":"Ma, Y., Liu, G.: Some results on fractional $$k$$-extendable graphs. Chin. J. Eng. Math. 21(4), 567\u2013573 (2004)","journal-title":"Chin. J. Eng. Math."},{"issue":"2","key":"44_CR23","first-page":"324","volume":"27","author":"Z Li","year":"2004","unstructured":"Li, Z., Yan, G.: Some result on the graphic isolated toughness and the existence of fractional factor. Acta Math. Appl. Sin. 27(2), 324\u2013333 (2004)","journal-title":"Acta Math. Appl. Sin."},{"issue":"1","key":"44_CR24","first-page":"31","volume":"13","author":"G Liu","year":"2000","unstructured":"Liu, G., Zhang, L.: Maximum fractional $$(0, f)$$-factors of graphs. Math. Appl. 13(1), 31\u201335 (2000)","journal-title":"Math. Appl."}],"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-62223-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T23:05:08Z","timestamp":1605049508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62223-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030622220","9783030622237"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62223-7_44","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)"}}]}}