{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:01:34Z","timestamp":1730199694103,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,12,14]]},"DOI":"10.1109\/bcd57833.2023.10466294","type":"proceedings-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T18:11:47Z","timestamp":1710871907000},"page":"222-230","source":"Crossref","is-referenced-by-count":0,"title":["An experimental evaluation of upper bounds of clique weights based on graph coloring"],"prefix":"10.1109","author":[{"given":"Yuki","family":"Kashihara","sequence":"first","affiliation":[{"name":"Kobe University,Graduate School of Engineering,Hyogo,Japan"}]},{"given":"Kazuaki","family":"Yamaguchi","sequence":"additional","affiliation":[{"name":"Kobe University,Graduate School of Engineering,Hyogo,Japan"}]},{"given":"Masahide","family":"Nakamura","sequence":"additional","affiliation":[{"name":"Kobe University,Graduate School of Engineering,Hyogo,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.01.026"},{"article-title":"A new exact algorithm for the maximum weight clique problem","volume-title":"Proceedings of the 23rd International Conference on Circuits\/Systems, Computers and Communitacion (ITC-CSCC 2008)","author":"Yamaguchi","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4203\/ccp.80.60"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01955041"},{"issue":"4","key":"ref6","first-page":"424","article-title":"A new algorithm for the maximum-Weight clique problem","volume":"8","author":"\u00d6sterg\u00e5rd","year":"2001","journal-title":"Nordic Journal of Computing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"}],"event":{"name":"2023 IEEE\/ACIS 8th International Conference on Big Data, Cloud Computing, and Data Science (BCD)","start":{"date-parts":[[2023,12,14]]},"location":"Hochimin City, Vietnam","end":{"date-parts":[[2023,12,16]]}},"container-title":["2023 IEEE\/ACIS 8th International Conference on Big Data, Cloud Computing, and Data Science (BCD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10466269\/10466270\/10466294.pdf?arnumber=10466294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:41:29Z","timestamp":1711478489000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10466294\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,14]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/bcd57833.2023.10466294","relation":{},"subject":[],"published":{"date-parts":[[2023,12,14]]}}}