{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:48Z","timestamp":1750220628156,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T00:00:00Z","timestamp":1592524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Creative Talents Project Fund of Guangdong Province Department of Education (Natural Science)","award":["2017KQNCX053"],"award-info":[{"award-number":["2017KQNCX053"]}]},{"name":"the Ph.D. Start-up Fund of Natural Science Foundation of Guangdong Province","award":["2018A030310516"],"award-info":[{"award-number":["2018A030310516"]}]},{"name":"Science and Technology Planning Project of Guangdong Province","award":["2017B03038009, 2017KZ010101"],"award-info":[{"award-number":["2017B03038009, 2017KZ010101"]}]},{"name":"the Featured Innovation Project of Guangdong Province Department of Education (Natural Science)","award":["2019KTSCX035"],"award-info":[{"award-number":["2019KTSCX035"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,19]]},"DOI":"10.1145\/3408127.3408196","type":"proceedings-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T03:31:13Z","timestamp":1599795073000},"page":"279-283","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Algorithms for Cyclic Edge Connectivity and Cyclic Vertex Connectivity of Cubic Graphs"],"prefix":"10.1145","author":[{"given":"Jun","family":"Liang","sequence":"first","affiliation":[{"name":"School of Software, South China Normal University, Foshan, China"}]},{"given":"Meixin","family":"Du","sequence":"additional","affiliation":[{"name":"School of Software, South China Normal University, Foshan, China"}]},{"given":"Ruihua","family":"Nie","sequence":"additional","affiliation":[{"name":"School of Computer, South China Normal University, Guangzhou, China"}]},{"given":"Zhihao","family":"Liang","sequence":"additional","affiliation":[{"name":"Zhichuang Center, Middle School, Shunde, China"}]},{"given":"Zheng","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen Guangming, Primary School, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2020,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1097029"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0370164600044229"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206354"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.046"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90229-M"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.04.055"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90004-H"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9759-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-019-02031-4"},{"key":"e_1_3_2_1_10_1","first-page":"236","volume-title":"Scandinavian Workshop on Algorithm Theory","author":"Dvo\u0159\u00e1k Zden\u011bk","year":"2004","unstructured":"Zden\u011bk Dvo\u0159\u00e1k , Jan K\u00e1ra , Ond\u0159ej Pangr\u00e1c , An algorithm for cyclic edge connectivity of cubic graphs . In Scandinavian Workshop on Algorithm Theory , pages 236 -- 247 . Springer , 2004 . Zden\u011bk Dvo\u0159\u00e1k, Jan K\u00e1ra, Ond\u0159ej Pangr\u00e1c, et al. An algorithm for cyclic edge connectivity of cubic graphs. In Scandinavian Workshop on Algorithm Theory, pages 236--247. Springer, 2004."},{"key":"e_1_3_2_1_11_1","first-page":"311","article-title":"An efficient algorithm for cyclic edge connectivity of regular graphs","volume":"77","author":"Lou Dingjun","year":"2005","unstructured":"Dingjun Lou and Wei Wang . An efficient algorithm for cyclic edge connectivity of regular graphs . Ars Combinatoria , 77 : 311 -- 318 , 2005 . Dingjun Lou and Wei Wang. An efficient algorithm for cyclic edge connectivity of regular graphs. Ars Combinatoria, 77:311--318, 2005.","journal-title":"Ars Combinatoria"},{"key":"e_1_3_2_1_12_1","first-page":"315","article-title":"An improved algorithm for cyclic edge connectivity of regular graphs","volume":"115","author":"Lou Dingjun","year":"2014","unstructured":"Dingjun Lou and Kangqi Liang . An improved algorithm for cyclic edge connectivity of regular graphs . ARS COMBINATORIA , 115 : 315 -- 333 , 2014 . Dingjun Lou and Kangqi Liang. An improved algorithm for cyclic edge connectivity of regular graphs. ARS COMBINATORIA, 115:315--333, 2014.","journal-title":"ARS COMBINATORIA"},{"key":"e_1_3_2_1_13_1","first-page":"69","article-title":"A square time algorithm for cyclic edge connectivity of planar graphs","volume":"133","author":"Lou Dingjun","year":"2017","unstructured":"Dingjun Lou . A square time algorithm for cyclic edge connectivity of planar graphs . ARS COMBINA-TORIA , 133 : 69 -- 92 , 2017 . Dingjun Lou. A square time algorithm for cyclic edge connectivity of planar graphs. ARS COMBINA-TORIA, 133:69--92, 2017.","journal-title":"ARS COMBINA-TORIA"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90121-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830911001322"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-012-1172-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2019.1659259"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2016.1210792"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0332-4"},{"key":"e_1_3_2_1_20_1","volume-title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. Journal of combinatorial optimization, 38(2):589--607","author":"Liang Jun","year":"2019","unstructured":"Jun Liang , Dingjun Lou , Zongrong Qin , and Qinglin Yu . A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. Journal of combinatorial optimization, 38(2):589--607 , 2019 . Jun Liang, Dingjun Lou, Zongrong Qin, and Qinglin Yu. A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. Journal of combinatorial optimization, 38(2):589--607, 2019."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2049721"}],"event":{"name":"ICDSP 2020: 2020 4th International Conference on Digital Signal Processing","sponsor":["University of Electronic Science and Technology of China University of Electronic Science and Technology of China"],"location":"Chengdu China","acronym":"ICDSP 2020"},"container-title":["Proceedings of the 2020 4th International Conference on Digital Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408127.3408196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3408127.3408196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:35Z","timestamp":1750197695000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408127.3408196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,19]]},"references-count":21,"alternative-id":["10.1145\/3408127.3408196","10.1145\/3408127"],"URL":"https:\/\/doi.org\/10.1145\/3408127.3408196","relation":{},"subject":[],"published":{"date-parts":[[2020,6,19]]},"assertion":[{"value":"2020-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}