{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:42:22Z","timestamp":1773895342420,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006105","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP160101513, FT170100128, DP180103096, FT180100256, DP200101338, DP180103096, DP170101628"],"award-info":[{"award-number":["DP160101513, FT170100128, DP180103096, FT180100256, DP200101338, DP180103096, DP170101628"]}],"id":[{"id":"10.13039\/501100006105","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC61232006"],"award-info":[{"award-number":["NSFC61232006"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2018YFB1003504"],"award-info":[{"award-number":["2018YFB1003504"]}]},{"DOI":"10.13039\/501100009193","name":"Marsden Fund","doi-asserted-by":"publisher","award":["UOA1732"],"award-info":[{"award-number":["UOA1732"]}],"id":[{"id":"10.13039\/501100009193","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389748","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"1367-1381","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Scaling Up Distance Labeling on Graphs with Core-Periphery Properties"],"prefix":"10.1145","author":[{"given":"Wentao","family":"Li","sequence":"first","affiliation":[{"name":"CAI, FEIT, University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Qiao","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"CAI, FEIT, University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"CAI, FEIT, University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"I. Abraham D. Delling A. V. Goldberg and R. F. F. Werneck. 2012. Hierarchical Hub Labelings for Shortest Paths. In ESA. 24--35.  I. Abraham D. Delling A. V. Goldberg and R. F. F. Werneck. 2012. Hierarchical Hub Labelings for Shortest Paths. In ESA. 24--35.","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"T. Akiba Y. Iwata and Y. Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349--360.  T. Akiba Y. Iwata and Y. Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349--360.","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"T. Akiba C. Sommer and K. Kawarabayashi. 2012. Shortest-path queries for complex networks: exploiting low tree-width outside the core. In EDBT. 144--155.  T. Akiba C. Sommer and K. Kawarabayashi. 2012. Shortest-path queries for complex networks: exploiting low tree-width outside the core. In EDBT. 144--155.","DOI":"10.1145\/2247596.2247614"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0608024"},{"key":"e_1_3_2_2_5_1","volume-title":"29th International Workshop, WG 2003","author":"Berry Anne","year":"2003","unstructured":"Anne Berry , Pinar Heggernes , and Genevi\u00e8 ve Simonet . 2003 . The Minimum Degree Heuristic and the Minimal Triangulation Process. In Graph-Theoretic Concepts in Computer Science , 29th International Workshop, WG 2003 , Elspeet, The Netherlands, June 19--21 , 2003, Revised Papers. 58--70. Anne Berry, Pinar Heggernes, and Genevi\u00e8 ve Simonet. 2003. The Minimum Degree Heuristic and the Minimal Triangulation Process. In Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19--21, 2003, Revised Papers. 58--70."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"P. Boldi and S. Vigna. 2004. The WebGraph Framework I: Compression Techniques. In WWW. ACM Press 595--601.  P. Boldi and S. Vigna. 2004. The WebGraph Framework I: Compression Techniques. In WWW. ACM Press 595--601.","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"L. Chang. 2019. Efficient Maximum Clique Computation over Large Sparse Graphs. In SIGKDD. 529--538.  L. Chang. 2019. Efficient Maximum Clique Computation over Large Sparse Graphs. In SIGKDD. 529--538.","DOI":"10.1109\/ICDE.2019.00241"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917434"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"J. Kunegis. 2013. Konect: the Koblenz Network Collection. In WWW. ACM 1343--1350.  J. Kunegis. 2013. Konect: the Koblenz Network Collection. In WWW. ACM 1343--1350.","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_2_15_1","unstructured":"J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data .  J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data ."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"W. Li M. Qiao L. Qin Y. Zhang L. Chang and X. Lin. 2019. Scaling Distance Labeling on Small-World Networks. In SIGMOD. 1060--1077.  W. Li M. Qiao L. Qin Y. Zhang L. Chang and X. Lin. 2019. Scaling Distance Labeling on Small-World Networks. In SIGMOD. 1060--1077.","DOI":"10.1145\/3299869.3319877"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732978"},{"key":"e_1_3_2_2_19_1","first-page":"1","article-title":"An Experimental Study of the Treewidth of Real-World Graph Data","volume":"12","author":"Maniu S.","year":"2019","unstructured":"S. Maniu , P. Senellart , and S. Jog . 2019 . An Experimental Study of the Treewidth of Real-World Graph Data . In ICDT. 12 : 1 -- 12 :18. S. Maniu, P. Senellart, and S. Jog. 2019. An Experimental Study of the Treewidth of Real-World Graph Data. In ICDT. 12:1--12:18.","journal-title":"ICDT."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"D. Ouyang Lu Q. L. Chang X. Lin Y. Zhang and Q. Zhu. 2018. When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In SIGMOD. ACM 709--724.  D. Ouyang Lu Q. L. Chang X. Lin Y. Zhang and Q. Zhu. 2018. When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In SIGMOD. ACM 709--724.","DOI":"10.1145\/3183713.3196913"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_2_22_1","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com","author":"Rossi R. A.","unstructured":"R. A. Rossi and N. K. Ahmed . 2015. The Network Data Repository with Interactive Graph Analytics and Visualization . In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com R. A. Rossi and N. K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"F. Wei. 2010. TEDI: efficient shortest path query answering on graphs. In SIGMOD. 99--110.  F. Wei. 2010. TEDI: efficient shortest path query answering on graphs. In SIGMOD. 99--110.","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0338-6"},{"key":"e_1_3_2_2_25_1","volume-title":"Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2005","author":"Xu J.","year":"2005","unstructured":"J. Xu , F. Jiao , and B. Berger . 2005. A Tree-Decomposition Approach to Protein Structure Prediction . In Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2005 , Stanford, CA, USA, August 8--11 , 2005 . 247--256. J. Xu, F. Jiao, and B. Berger. 2005. A Tree-Decomposition Approach to Protein Structure Prediction. In Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2005, Stanford, CA, USA, August 8--11, 2005. 247--256."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389748","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":25,"alternative-id":["10.1145\/3318464.3389748","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389748","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}