{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T06:22:34Z","timestamp":1757571754078,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"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":[[2021,7,6]]},"DOI":"10.1109\/icccnt51525.2021.9580066","type":"proceedings-article","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T19:29:48Z","timestamp":1635967788000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Disjoint Set Union for Trees"],"prefix":"10.1109","author":[{"given":"Amit","family":"Yadav","sequence":"first","affiliation":[]},{"given":"Harsh","family":"Shokeen","sequence":"additional","affiliation":[]},{"given":"Jitesh","family":"Yadav","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0222064"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933108"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/69.277778"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.30"},{"journal-title":"C++ clock() - C++ standard library","year":"0","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_35"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.4.701"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.877518"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116878"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0219060"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.228"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3012434"},{"key":"ref1","first-page":"467","article-title":"Data Structures for Direct Spanning Tree Representations in Mutation-Based Evolutionary Algorithms","volume":"24","author":"barbosa","year":"2020","journal-title":"IEEE Trans Evol Comput"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.8"}],"event":{"name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","start":{"date-parts":[[2021,7,6]]},"location":"Kharagpur, India","end":{"date-parts":[[2021,7,8]]}},"container-title":["2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9579467\/9579470\/09580066.pdf?arnumber=9580066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:43Z","timestamp":1652201743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9580066\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icccnt51525.2021.9580066","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]}}}