{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:17:29Z","timestamp":1749010649167,"version":"3.41.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["W911 NF-13-1- 0130"],"award-info":[{"award-number":["W911 NF-13-1- 0130"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1560625"],"award-info":[{"award-number":["1560625"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006228","name":"Oak Ridge National Laboratory","doi-asserted-by":"publisher","award":["4000144962"],"award-info":[{"award-number":["4000144962"]}],"id":[{"id":"10.13039\/100006228","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s40537-016-0042-7","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T12:58:45Z","timestamp":1465822725000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Towards shortest path identification on large networks"],"prefix":"10.1186","volume":"3","author":[{"given":"Haysam","family":"Selim","sequence":"first","affiliation":[]},{"given":"Justin","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"key":"42_CR1","unstructured":"Palmer C, Cragin M, Smith L, Heidorn P. Data curation for the long tail of science: the case of environmental science. In: Third international digital curation conference, Washington, DC. 2007."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Fujita Y, Nakamura Y, Shiller Z. Dual Dijkstra search for paths with different topologies. In: 2003. Proceedings IEEE international conference on robotics and automation, ICRA\u201903, vol. 3. New York: IEEE. p. 3359\u201364.","DOI":"10.1109\/ROBOT.2003.1242109"},{"key":"42_CR3","volume-title":"An improvement of The shortest path algorithm based on Dijkstra algorithm","author":"FL Lu","year":"2010","unstructured":"Lu FL, Xiao JX. An improvement of The shortest path algorithm based on Dijkstra algorithm. New York: IEEE; 2010."},{"key":"42_CR4","volume-title":"Dijkstra\u2019s shortest path algorithm serial and parallel execution performance analysis","author":"A Elma","year":"2012","unstructured":"Elma A, Jasika N, Alispahic N, Ilvana K, Elma L, Nosovic N. Dijkstra\u2019s shortest path algorithm serial and parallel execution performance analysis. New York: IEEE; 2012."},{"key":"42_CR5","volume-title":"Developed Dijkstra path search algorithm and simulation","author":"W Hongxia","year":"2010","unstructured":"Hongxia W, Chao Y. Developed Dijkstra path search algorithm and simulation. New York: IEEE; 2010."},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Fuhao Z, Jiping L. An algorithm of shortest path based on Dijkstra for huge data. In: Sixth International conference on fuzzy systems and knowledge discovery, 2009. FSKD\u201909, vol. 4, p. 244-247.","DOI":"10.1109\/FSKD.2009.848"},{"key":"42_CR7","unstructured":"Martins ED, Dos Santos JL. A new shortest paths ranking algorithm. 1999."},{"key":"42_CR8","unstructured":"Lawler EL. Combinatorial optimization: networks and matroids. Collision detection library. New York: Holt, Rinehart and Winston; 2001. p. 98\u2013100."},{"issue":"6","key":"42_CR9","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1109\/70.105387","volume":"7","author":"Z Shiller","year":"1991","unstructured":"Shiller Z, Dubowsky S. On computing the global time optimal motions of robotic manipulators in the presence of obstacles. IEEE trans Robot Autom. 1991;7(6):785\u201397.","journal-title":"IEEE trans Robot Autom"},{"key":"42_CR10","unstructured":"Tseng W-LD. The shortest path problem. 2013. http:\/\/www.cs.cornell.edu\/~wdtseng\/icpc\/notes\/graph_part2.pdf . Accessed 1 Jan 2015."},{"key":"42_CR11","unstructured":"Selim H, Chopade P, Zhan J. Statistical modeling and scalable, interactive visualization of large scale big data networks. Los Angeles: Academy of Science and Engineering (ASE); 2014."},{"key":"42_CR12","unstructured":"Johnson MW, Eagle M, Stamper J. An algorithm for reducing the complexity of interaction networks. EDM. 2013."},{"key":"42_CR13","unstructured":"Harris Interactive, Inc., \u201cHarris Generation 2001 World Trade Center Survey Study No. J15085.\u201d Odum Institute. Odum Institute, Odum Institute for Research in Social Science, University of North Carolina. http:\/\/arc.irss.unc.edu\/dvn\/ ."},{"key":"42_CR14","volume-title":"Sociometry, experimental method and the science of society: an approach to a new political orientation","author":"J Moreno","year":"1951","unstructured":"Moreno J. Sociometry, experimental method and the science of society: an approach to a new political orientation. New York: Beacon House; 1951."},{"issue":"3","key":"42_CR15","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1353\/lib.0.0050","volume":"57","author":"S Morris","year":"2009","unstructured":"Morris S, Tuttle J, Essic J. A partnership framework for geospatial data preservation in North Carolina library trends. Libr Trends. 2009;57(3):516\u201340.","journal-title":"Libr Trends"},{"key":"42_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503","volume-title":"Fast and accurate estimation of shortest paths in large graphs","author":"A Gubichev","year":"2010","unstructured":"Gubichev A, Bedathur S, Weikum G. Fast and accurate estimation of shortest paths in large graphs. New York: ACM; 2010."},{"key":"42_CR17","volume-title":"Social network reduction based on stability","author":"V Snasel","year":"2010","unstructured":"Snasel V, Kudelka M, Horak Z, Abraham A. Social network reduction based on stability. New York: IEEE; 2010."},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Bartha M, Kresz M. A depth-first algorithm to reduce graphs in linear time. In: Proceedings of the 2009 11th international symposium on symbolic and numeric algorithms for scientific computing. Timisoara: IEEE Computer Society; 2009. p. 273\u2013281.","DOI":"10.1109\/SYNASC.2009.48"},{"key":"42_CR19","unstructured":"Lin H, Zhao Z, Li H, Chen Z. A novel graph reduction algorithm to identify structural conflicts. In: Proceedings of the 35th Hawaii international conference on systems sciences, Hawaii, USA. 2002. p. 195\u2013209."},{"key":"42_CR20","volume-title":"A method for the shortest path search by extended dijkstras algorithm","author":"H Sato","year":"2000","unstructured":"Sato H, Noto M. A method for the shortest path search by extended dijkstras algorithm. New York: IEEE; 2000."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Boriah S, Chandola V, Kumar V. Similarity measures for categorical data: a comparative evaluation. In: Proceedings of the eighth SIAM international conference on data mining, Atlanta. 2008. p. 243\u201354.","DOI":"10.1137\/1.9781611972788.22"},{"issue":"1","key":"42_CR22","first-page":"15","volume":"2","author":"X Fang","year":"2013","unstructured":"Fang X, Zhan J, Koceja N. A novel framework on data network reduction. Science. 2013;2(1):15.","journal-title":"Science"},{"key":"42_CR23","unstructured":"Shu-xi W, Xing-qiu Z. The improved Dijkstra\u2019s shortest path algorithm. In: Natural computation (ICNC), 2011 seventh international conference on, vol. 4. New York: IEEE. p. 2313\u201316."},{"issue":"9","key":"42_CR24","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J. Algorithm 457: finding all cliques of an undirected graph. ACM. 1973;16(9):575\u20137.","journal-title":"ACM"},{"key":"42_CR25","unstructured":"Selim H, Chopade P, Zhan J. Structural analysis and interactive visualization of large scale big data networks. In: IEEE 11th annual international conference and expo on emerging technologies for a smarter world (CEWIT2014), Melville, New York; 2014."},{"key":"42_CR26","unstructured":"Selim H, Chopade P, Zhan J. Node degree and edge clustering correlation for community detection in big data and largescale networks. Los Angeles: Academy of Science and Engineering (ASE). 2014."},{"issue":"4","key":"42_CR27","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng J, Ke Y, Fu A, Yu J, Zhu L. Finding maximal cliques in massive networks. ACM Trans Database Syst. 2011;36(4):21\u201334.","journal-title":"ACM Trans Database Syst"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0042-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-016-0042-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0042-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0042-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T21:33:51Z","timestamp":1748986431000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-016-0042-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1186\/s40537-016-0042-7","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2016,6,13]]},"assertion":[{"value":"21 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}