{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T16:27:30Z","timestamp":1747326450747,"version":"3.37.3"},"reference-count":82,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute of Information and Communication Technology Planning and Evaluation (IITP) grant","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea Government (MSIT), Development of Cloud-Edge based City-Traffic Brain Technology","award":["2020-0-00073"],"award-info":[{"award-number":["2020-0-00073"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3077888","type":"journal-article","created":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T19:50:40Z","timestamp":1620330640000},"page":"69539-69558","source":"Crossref","is-referenced-by-count":4,"title":["AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3207-4648","authenticated-orcid":false,"given":"Sung-Soo","family":"Kim","sequence":"first","affiliation":[{"name":"Artificial Intelligence Research Laboratory, Electronics and Telecommunications Research Institute, Daejeon, South Korea"}]},{"given":"Young-Kuk","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chungnam National University, Daejeon, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2796-194X","authenticated-orcid":false,"given":"Young-Min","family":"Kang","sequence":"additional","affiliation":[{"name":"Department of Game Engineering, Tongmyong University, Busan, South Korea"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref73","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"doi-asserted-by":"publisher","key":"ref72","DOI":"10.1145\/3183713.3190654"},{"doi-asserted-by":"publisher","key":"ref71","DOI":"10.1145\/3104031"},{"doi-asserted-by":"publisher","key":"ref70","DOI":"10.1007\/978-1-4419-6045-0_6"},{"doi-asserted-by":"publisher","key":"ref76","DOI":"10.1145\/2939672.2939753"},{"doi-asserted-by":"publisher","key":"ref77","DOI":"10.1109\/TKDE.2018.2849727"},{"doi-asserted-by":"publisher","key":"ref74","DOI":"10.1145\/3210259.3210269"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1145\/2939672.2939754"},{"doi-asserted-by":"publisher","key":"ref75","DOI":"10.1145\/3308558.3313660"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1145\/2623330.2623732"},{"key":"ref78","first-page":"203","article-title":"Community preserving network embedding","author":"wang","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"key":"ref79","article-title":"A tutorial on network embeddings","author":"chen","year":"2018","journal-title":"arXiv 1808 02590"},{"key":"ref33","article-title":"Network representation learning: A survey","author":"zhang","year":"2017","journal-title":"arXiv 1801 05852"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/2806416.2806512"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.13053\/cys-23-4-3236"},{"year":"2006","author":"kleinberg","journal-title":"Algorithm Design","key":"ref30"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1038\/s41586-020-2649-2"},{"year":"2012","author":"mccool","journal-title":"Structured Parallel Programming Patterns for Efficient Computation","key":"ref36"},{"key":"ref35","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst 27th Annu Conf Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/978-3-540-77891-2_6"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1016\/0743-7315(91)90083-L"},{"doi-asserted-by":"publisher","key":"ref62","DOI":"10.1145\/2213977.2214056"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.1093\/imamat\/15.2.161"},{"doi-asserted-by":"publisher","key":"ref63","DOI":"10.1145\/3332466.3374533"},{"year":"2014","author":"leskovec","journal-title":"SNAP Datasets Stanford large network dataset collection","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref64","DOI":"10.1145\/367766.368168"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/2806416.2806512"},{"doi-asserted-by":"publisher","key":"ref65","DOI":"10.1145\/321992.321993"},{"doi-asserted-by":"publisher","key":"ref66","DOI":"10.1109\/FOCS.2018.00061"},{"key":"ref29","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"doi-asserted-by":"publisher","key":"ref67","DOI":"10.1145\/3350755.3400256"},{"key":"ref68","article-title":"Near-optimal decremental sssp in dense weighted digraphs","author":"bernstein","year":"2020","journal-title":"arXiv 2004 04496"},{"doi-asserted-by":"publisher","key":"ref69","DOI":"10.1145\/3313276.3316326"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.2200\/S00449ED1V01Y201209DMK006"},{"key":"ref1","article-title":"Examining COVID-19 forecasting using spatio-temporal graph neural networks","author":"kapoor","year":"2020","journal-title":"arXiv 2007 03113"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TKDE.2018.2873750"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1142\/SMPAI"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.jda.2016.09.001"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/978-981-33-4022-0"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.2200\/S01045ED1V01Y202009AIM046"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/2736277.2741093"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/3184558.3186900"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1103\/PhysRevE.65.026107"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1086\/jar.33.4.3629752"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1016\/S0304-3975(03)00402-X"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1145\/316542.316548"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1007\/978-1-4939-2864-4_12"},{"doi-asserted-by":"publisher","key":"ref56","DOI":"10.1145\/2344422.2344424"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1007\/s11227-016-1748-1"},{"key":"ref54","article-title":"A survey of shortest-path algorithms","author":"madkour","year":"2017","journal-title":"arXiv 1705 02044"},{"key":"ref53","article-title":"A fastest route planning for LBS based on traffic prediction","author":"kang","year":"2005","journal-title":"Proc 9th Int Conf Syst"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1073\/pnas.0601602103"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ICCIT.2007.147"},{"key":"ref11","first-page":"521","article-title":"Improved spatial modeling using path distance metric for urban traffic prediction","author":"kim","year":"2019","journal-title":"Proc 7th Int Conf Big Data Appl Services (BIGDAS)"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/SFFCS.1999.814635"},{"key":"ref12","first-page":"1","article-title":"Low-dimensional statistical manifold embedding of directed graphs","author":"funke","year":"2020","journal-title":"Proc 8th Int Conf Learn Represent (ICLR)"},{"key":"ref13","article-title":"Adversarial directed graph embedding","author":"zhu","year":"2020","journal-title":"arXiv 2008 03667"},{"key":"ref14","first-page":"395","article-title":"Node representation learning for directed graphs","volume":"11906","author":"khosla","year":"2019","journal-title":"Proc Eur Conf Mach Learn Knowl Discovery Databases"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1137\/15M1024524"},{"doi-asserted-by":"publisher","key":"ref82","DOI":"10.1145\/1376616.1376661"},{"key":"ref16","first-page":"2942","article-title":"Scalable graph embedding for asymmetric proximity","author":"zhou","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"doi-asserted-by":"publisher","key":"ref81","DOI":"10.1145\/3292500.3330992"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/2939672.2939751"},{"key":"ref18","first-page":"2707","article-title":"Directed graph embedding","author":"chen","year":"2007","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.24963\/ijcai.2017\/544"},{"doi-asserted-by":"publisher","key":"ref80","DOI":"10.1145\/3186727"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1132952.1132954"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Diameter of the world-wide Web","volume":"401","author":"reka","year":"1999","journal-title":"Nature"},{"key":"ref6","article-title":"Handbook of network analysis [KONECT–the Koblenz network collection]","author":"kunegis","year":"2014","journal-title":"arXiv 1402 5500"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ASONAM.2012.211"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1006\/jcss.1995.1078"},{"key":"ref7","first-page":"360","article-title":"Urban traffic prediction using congestion diffusion model","author":"kim","year":"2020","journal-title":"Proc IEEE Int Conf Consum Electron -Asia (ICCE-Asia)"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1007\/978-1-4939-2864-4_11"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/3219819.3219969"},{"year":"2009","author":"bang-jensen","journal-title":"Digraphs–Theory Algorithms and Applications","key":"ref46"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1016\/0095-8956(83)90059-X"},{"year":"2021","journal-title":"NetworkX Network Analysis in Python","key":"ref48"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1145\/3357713.3384330"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.14778\/3372716.3372720"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/SFCS.1998.743464"},{"key":"ref44","first-page":"7134","article-title":"Position-aware Graph Neural Networks","volume":"97","author":"you","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn (ICML)"},{"key":"ref43","article-title":"PEFP: Efficient K-hop Constrained s-t Simple Path Enumeration on FPGA","author":"lai","year":"2020","journal-title":"arXiv 2012 11128"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09424548.pdf?arnumber=9424548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:32:27Z","timestamp":1662669147000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9424548\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":82,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3077888","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}