{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:29:00Z","timestamp":1742966940469,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819772377"},{"type":"electronic","value":"9789819772384"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7238-4_23","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"360-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Efficient Heuristic Graph Edge Coloring"],"prefix":"10.1007","author":[{"given":"Haofei","family":"Sui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Motwani, R.: Switch scheduling via randomized edge coloring. In: 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 502\u2013512. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238223"},{"key":"23_CR2","unstructured":"Allwright, J., Bordawekar, R., Coddington, P., Dincer, K., Martin, C.: A comparison of parallel graph coloring algorithms. In: SCCS-666, pp. 1\u201319 (1995)"},{"key":"23_CR3","unstructured":"Barenboim, L., Elkin, M.: Distributed graph coloring: fundamentals and recent developments (2022)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Grandoni, F., Wajc, D.: Online edge coloring algorithms via the nibble method. In: Proceedings of ACM-SIAM SODA, pp. 2830\u20132842 (2021)","DOI":"10.1137\/1.9781611976465.168"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"11","key":"23_CR6","first-page":"11079","volume":"35","author":"Z Chen","year":"2022","unstructured":"Chen, Z., Yuan, L., Lin, X., Qin, L., Zhang, W.: Balanced clique computation in signed networks: concepts and algorithms. IEEE TKDE 35(11), 11079\u201311092 (2022)","journal-title":"IEEE TKDE"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"TF Coleman","year":"1983","unstructured":"Coleman, T.F., Mor\u00e9, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20(1), 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1\u20132","key":"23_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255(1\u20132), 33\u201350 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR9","unstructured":"Ghosh, P., Stoeckl, M.: Low-memory algorithms for online and w-streaming edge coloring. arXiv preprint arXiv:2304.12285 (2023)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 166\u2013177 (2014)","DOI":"10.1145\/2612669.2612697"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Hilgemeier, M., Drechsler: Fast heuristics for the edge coloring of large graphs. In: Proceedings of Euromicro Symposium Digital Systems Design, pp. 230\u2013237. IEEE (2003)","DOI":"10.1109\/DSD.2003.1231932"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"23_CR13","unstructured":"Hsu, C.C., Liu, P., Wang, D.w., Wu, J.J.: Generalized edge coloring for channel assignment in wireless networks. In: Proceedings of ICPP, pp. 82\u201392. IEEE (2006)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Z., Yuan, L., Sui, H., Chen, Z., Yang, S., Yang, J.: Edge coloring on dynamic graphs. In: Proceedings of DASFAA, pp. 137\u2013153 (2023)","DOI":"10.1007\/978-3-031-30675-4_10"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.03.038","volume":"254","author":"T Januario","year":"2016","unstructured":"Januario, T., Urrutia, S., Ribeiro, C.C., De Werra, D.: Edge Coloring: a natural model for sports scheduling. Eur. J. Oper. Res. 254(1), 1\u20138 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"23_CR16","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"MT Jones","year":"1993","unstructured":"Jones, M.T., Plassmann, P.E.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14(3), 654\u2013669 (1993)","journal-title":"SIAM J. Sci. Comput."},{"issue":"17","key":"23_CR17","doi-asserted-by":"publisher","first-page":"3593","DOI":"10.1016\/j.dam.2009.04.002","volume":"157","author":"A Kosowski","year":"2009","unstructured":"Kosowski, A.: Approximating the maximum 2-and 3-edge-colorable subgraph problems. Discrete Appl. Math. 157(17), 3593\u20133600 (2009)","journal-title":"Discrete Appl. Math."},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Leeuwen, J.V., Hartmanis, J., Goos, G.: Computer science today: recent trends and developments. Springer (1995). https:\/\/doi.org\/10.1007\/BFb0015232","DOI":"10.1007\/BFb0015232"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Lewis, H.R.: Computers and intractability. a guide to the theory of np-completeness. J. Symb. Log. 48(2), 498\u2013500 (1983)","DOI":"10.2307\/2273574"},{"issue":"1\u20133","key":"23_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L., Saks, M., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75(1\u20133), 319\u2013325 (1989)","journal-title":"Discrete Math."},{"issue":"9","key":"23_CR21","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/JPROC.2023.3306773","volume":"111","author":"C Ma","year":"2023","unstructured":"Ma, C., et al.: Trusted AI in multiagent systems: an overview of privacy and security for distributed learning. Proc. IEEE 111(9), 1097\u20131132 (2023)","journal-title":"Proc. IEEE"},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"23_CR23","unstructured":"Meng, L., et al.: A survey of distributed graph algorithms on massive graphs. arXiv preprint arXiv:2404.06037 (2024)"},{"issue":"3","key":"23_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra, J., Gries, D.: A constructive proof of Vizing\u2019s theorem. Inf. Process. Lett. 41(3), 131\u2013133 (1992)","journal-title":"Inf. Process. Lett."},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 134\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"key":"23_CR26","unstructured":"Saberi, A., Wajc, D.: The greedy algorithm is not optimal for on-line edge coloring. In: Proceedings of 48th ICALP. Schloss Dagstuhl (2021)"},{"key":"23_CR27","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Anal. 3, 25\u201330 (1964)","journal-title":"Diskret. Anal."},{"key":"23_CR28","first-page":"9","volume":"5","author":"VG Vizing","year":"1965","unstructured":"Vizing, V.G.: Critical graphs with given chromatic class. Metody Diskret. Anal. 5, 9\u201317 (1965). (in Russian)","journal-title":"Metody Diskret. Anal."},{"issue":"1","key":"23_CR29","first-page":"85","volume":"10","author":"DJ Welsh","year":"1967","unstructured":"Welsh, D.J., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. TCJ 10(1), 85\u201386 (1967)","journal-title":"TCJ"},{"issue":"3","key":"23_CR30","first-page":"338","volume":"11","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Effective and efficient dynamic graph coloring. PVLDB 11(3), 338\u2013351 (2017)","journal-title":"PVLDB"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7238-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T09:40:34Z","timestamp":1732700434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7238-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772377","9789819772384"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7238-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}