{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:06Z","timestamp":1750220886884,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Natural Science Foundation of China","award":["11761042,11461081,11361030, 11101193"],"award-info":[{"award-number":["11761042,11461081,11361030, 11101193"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,15]]},"DOI":"10.1145\/3371676.3371691","type":"proceedings-article","created":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T04:40:36Z","timestamp":1578976836000},"page":"118-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Polynomial-time Solvability for Edge Packing on Graphs"],"prefix":"10.1145","author":[{"given":"Jiaxin","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China"}]},{"given":"Xuerong","family":"Yue","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China"}]},{"given":"Zhibin","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan, China"}]}],"member":"320","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90178-5"},{"volume-title":"European Conference on Computer Vision (ECCV). 1--7.","author":"Bai M.","key":"e_1_3_2_1_2_1","unstructured":"M. Bai , W. Luo , K. Kundu , and R. Urtasun . 2016. Exploiting semantic information and deep matching for optical flow . In European Conference on Computer Vision (ECCV). 1--7. M. Bai, W. Luo, K. Kundu, and R. Urtasun. 2016. Exploiting semantic information and deep matching for optical flow. In European Conference on Computer Vision (ECCV). 1--7."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"W.J. Cook W.H. Cunningham W.R. Pulleyblank and A. Schrijver. 1998. Combinatorial Optimization. Wiley New York Report. University of Maryland at College Park.  W.J. Cook W.H. Cunningham W.R. Pulleyblank and A. Schrijver. 1998. Combinatorial Optimization. Wiley New York Report. University of Maryland at College Park.","DOI":"10.1002\/9781118033142"},{"key":"e_1_3_2_1_4_1","volume-title":"New York: W","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey . and D. S. Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness . New York: W . H. Freeman . M.R. Garey. and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman."},{"key":"e_1_3_2_1_5_1","unstructured":"A.M.H. Gerards. 1995. Matching in: Network Models. M.O. Ball T.L. Magnanti C.L. Monma and G.L. Nemhauser (eds.) North Holland.  A.M.H. Gerards. 1995. Matching in: Network Models. M.O. Ball T.L. Magnanti C.L. Monma and G.L. Nemhauser (eds.) North Holland."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"P. Keevash and R. Mycroft. 2013.A geometric theory for hypergraph matching. Memoirs of the American Mathematical Society.233(1098).  P. Keevash and R. Mycroft. 2013.A geometric theory for hypergraph matching. Memoirs of the American Mathematical Society.233(1098).","DOI":"10.1090\/memo\/1098"},{"key":"e_1_3_2_1_7_1","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte B.","year":"2008","unstructured":"B. Korte . and J. Vygen . 2008 . Combinatorial Optimization: Theory and Algorithms . Fourth Edition, Berlin , Springer. B. Korte. and J. Vygen. 2008. Combinatorial Optimization: Theory and Algorithms. Fourth Edition, Berlin, Springer."},{"key":"e_1_3_2_1_8_1","unstructured":"L. Lov\u00e1sz. and M. D. Plummer. 1986. Matching Theory. North-Holland-Amsterdam New York.  L. Lov\u00e1sz. and M. D. Plummer. 1986. Matching Theory. North-Holland-Amsterdam New York."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/31027"},{"key":"e_1_3_2_1_10_1","first-page":"439","volume-title":"Mathematical Programming: The State of the Art","author":"Schrijver A.","unstructured":"A. Schrijver . 1982. Min-Max results in combinatorial optimization , in: Mathematical Programming: The State of the Art , (A. Bachem, M. Grotschel, and B. Korte, eds.) Springer, Berlin . pp. 439 -- 500 . A. Schrijver. 1982. Min-Max results in combinatorial optimization, in: Mathematical Programming: The State of the Art, (A. Bachem, M. Grotschel, and B. Korte, eds.) Springer, Berlin. pp. 439--500."},{"volume-title":"Combinatorial Optimization Polyhedral and Efficiency","author":"Schrijver A.","key":"e_1_3_2_1_11_1","unstructured":"A. Schrijver . 2003. Combinatorial Optimization Polyhedral and Efficiency . Springer-Verlag , Berlin, Germany . A. Schrijver. 2003. Combinatorial Optimization Polyhedral and Efficiency. Springer-Verlag, Berlin, Germany."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-033-3"},{"volume-title":"Introduction to Graph Theory","author":"West D.B.","key":"e_1_3_2_1_13_1","unstructured":"D.B. West .2001. Introduction to Graph Theory . Prentice-Hall , Englewood Cliffs, NJ , ( Second edition). D.B. West.2001. Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs, NJ, (Second edition)."},{"volume-title":"Approximation Algorithms","author":"Vazirani V. V.","key":"e_1_3_2_1_14_1","unstructured":"V. V. Vazirani . 2001. Approximation Algorithms . Springer , Hong Kong . V. V. Vazirani. 2001. Approximation Algorithms. Springer, Hong Kong."},{"volume-title":"2018 9th International Conference on Information Technology in Medicine and Education (ITME) 1, 20--23","author":"Zhang Y.","key":"e_1_3_2_1_15_1","unstructured":"Y. Zhang , X. Duan , X. Yue , and Z. Chen . 2018. A new efficient algorithm for weighted vertex cover in bipartite graphs based on a dual problem . 2018 9th International Conference on Information Technology in Medicine and Education (ITME) 1, 20--23 . Y. Zhang, X. Duan, X. Yue, and Z. Chen. 2018. A new efficient algorithm for weighted vertex cover in bipartite graphs based on a dual problem. 2018 9th International Conference on Information Technology in Medicine and Education (ITME) 1, 20--23."}],"event":{"name":"ICCNS 2019: 2019 the 9th International Conference on Communication and Network Security","sponsor":["University of Tokyo","Chongqing University of Posts and Telecommunications"],"location":"Chongqing China","acronym":"ICCNS 2019"},"container-title":["Proceedings of the 2019 9th International Conference on Communication and Network Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371676.3371691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371676.3371691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:23Z","timestamp":1750203863000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371676.3371691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,15]]},"references-count":15,"alternative-id":["10.1145\/3371676.3371691","10.1145\/3371676"],"URL":"https:\/\/doi.org\/10.1145\/3371676.3371691","relation":{},"subject":[],"published":{"date-parts":[[2019,11,15]]},"assertion":[{"value":"2020-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}