{"id":"https://openalex.org/W3167215324","doi":"https://doi.org/10.1155/2021/6639008","title":"DMGA: A Distributed Shortest Path Algorithm for Multistage Graph","display_name":"DMGA: A Distributed Shortest Path Algorithm for Multistage Graph","publication_year":2021,"publication_date":"2021-05-31","ids":{"openalex":"https://openalex.org/W3167215324","doi":"https://doi.org/10.1155/2021/6639008","mag":"3167215324"},"language":"en","primary_location":{"id":"doi:10.1155/2021/6639008","is_oa":true,"landing_page_url":"http://doi.org/10.1155/2021/6639008","pdf_url":"https://downloads.hindawi.com/journals/sp/2021/6639008.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/sp/2021/6639008.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000202379","display_name":"Huanqing Cui","orcid":"https://orcid.org/0000-0002-9251-680X"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Huanqing Cui","raw_affiliation_strings":["College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, Shandong, China"],"raw_orcid":"https://orcid.org/0000-0002-9251-680X","affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, Shandong, China","institution_ids":["https://openalex.org/I80143920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100744098","display_name":"Ruixue Liu","orcid":"https://orcid.org/0000-0001-6915-7717"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruixue Liu","raw_affiliation_strings":["College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, Shandong, China"],"raw_orcid":"https://orcid.org/0000-0001-6915-7717","affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, Shandong, China","institution_ids":["https://openalex.org/I80143920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079048949","display_name":"Shaohua Xu","orcid":"https://orcid.org/0000-0002-0422-1180"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shaohua Xu","raw_affiliation_strings":["College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, Shandong, China"],"raw_orcid":"https://orcid.org/0000-0002-0422-1180","affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, Shandong, China","institution_ids":["https://openalex.org/I80143920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048370495","display_name":"Chuanai Zhou","orcid":"https://orcid.org/0000-0002-8325-6049"},"institutions":[{"id":"https://openalex.org/I186691195","display_name":"Qingdao Binhai University","ror":"https://ror.org/023er3e86","country_code":"CN","type":"education","lineage":["https://openalex.org/I186691195"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chuanai Zhou","raw_affiliation_strings":["College of Business, Qingdao Binhai University, Qingdao, Shandong, China"],"raw_orcid":"https://orcid.org/0000-0002-8325-6049","affiliations":[{"raw_affiliation_string":"College of Business, Qingdao Binhai University, Qingdao, Shandong, China","institution_ids":["https://openalex.org/I186691195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000202379"],"corresponding_institution_ids":["https://openalex.org/I80143920"],"apc_list":{"value":1800,"currency":"USD","value_usd":1800},"apc_paid":{"value":1800,"currency":"USD","value_usd":1800},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05645578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2021","issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7561341524124146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6788336634635925},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5185832977294922},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5087633728981018},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4991183280944824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4891500771045685},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47191789746284485},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4567301571369171},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.43814605474472046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3533543348312378},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3290838301181793},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3097570538520813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29140958189964294}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7561341524124146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6788336634635925},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5185832977294922},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5087633728981018},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4991183280944824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4891500771045685},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47191789746284485},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4567301571369171},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.43814605474472046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3533543348312378},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3290838301181793},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3097570538520813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29140958189964294}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1155/2021/6639008","is_oa":true,"landing_page_url":"http://doi.org/10.1155/2021/6639008","pdf_url":"https://downloads.hindawi.com/journals/sp/2021/6639008.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b5260e90cde349d9bdb2a8557f5679b3","is_oa":true,"landing_page_url":"https://doaj.org/article/b5260e90cde349d9bdb2a8557f5679b3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scientific Programming, Vol 2021 (2021)","raw_type":"article"},{"id":"pmh:oai:hindawi.com:10.1155/2021/6639008","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/6639008","pdf_url":null,"source":{"id":"https://openalex.org/S4306400340","display_name":"Hindawi Journal of Chemistry (Hindawi)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210126990","host_organization_name":"Hindawi (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210126990"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Research Article"}],"best_oa_location":{"id":"doi:10.1155/2021/6639008","is_oa":true,"landing_page_url":"http://doi.org/10.1155/2021/6639008","pdf_url":"https://downloads.hindawi.com/journals/sp/2021/6639008.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2960338844","display_name":null,"funder_award_id":"2019KJN024","funder_id":"https://openalex.org/F4320336653","funder_display_name":"Science and Technology Support Plan for Youth Innovation of Colleges and Universities of Shandong Province of China"},{"id":"https://openalex.org/G6516454832","display_name":null,"funder_award_id":"2018YFC1406203","funder_id":"https://openalex.org/F4320336653","funder_display_name":"Science and Technology Support Plan for Youth Innovation of Colleges and Universities of Shandong Province of China"},{"id":"https://openalex.org/G7404610982","display_name":null,"funder_award_id":"SDYY17040","funder_id":"https://openalex.org/F4320336653","funder_display_name":"Science and Technology Support Plan for Youth Innovation of Colleges and Universities of Shandong Province of China"}],"funders":[{"id":"https://openalex.org/F4320336653","display_name":"Science and Technology Support Plan for Youth Innovation of Colleges and Universities of Shandong Province of China","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3167215324.pdf","grobid_xml":"https://content.openalex.org/works/W3167215324.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1448681276","https://openalex.org/W1611975322","https://openalex.org/W1982003698","https://openalex.org/W1982861695","https://openalex.org/W1985419898","https://openalex.org/W1986603225","https://openalex.org/W2006023152","https://openalex.org/W2031709923","https://openalex.org/W2091635795","https://openalex.org/W2096544401","https://openalex.org/W2107173440","https://openalex.org/W2110326711","https://openalex.org/W2128479026","https://openalex.org/W2131717600","https://openalex.org/W2170616854","https://openalex.org/W2301743601","https://openalex.org/W2409471617","https://openalex.org/W2502734103","https://openalex.org/W2516447883","https://openalex.org/W2560134660","https://openalex.org/W2735293446","https://openalex.org/W2761683778","https://openalex.org/W2766234224","https://openalex.org/W2872018413","https://openalex.org/W2889350994","https://openalex.org/W2903766865","https://openalex.org/W2914171210","https://openalex.org/W2915426364","https://openalex.org/W2928616111","https://openalex.org/W2949522840","https://openalex.org/W2962788437","https://openalex.org/W2963091180","https://openalex.org/W2963528540","https://openalex.org/W2963948050","https://openalex.org/W2981558812","https://openalex.org/W2990824961","https://openalex.org/W2990977903","https://openalex.org/W2997951757","https://openalex.org/W3034344358","https://openalex.org/W3035483307","https://openalex.org/W3104013658","https://openalex.org/W4246219036","https://openalex.org/W6676526174"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2018146256","https://openalex.org/W2002764510","https://openalex.org/W4293054712","https://openalex.org/W2779966368","https://openalex.org/W2198982833","https://openalex.org/W2183791707","https://openalex.org/W2348504720","https://openalex.org/W4390139760"],"abstract_inverted_index":{"The":[0,85],"multistage":[1,23,61,83,168],"graph":[2,36,90],"problem":[3,76],"is":[4,15,138],"a":[5,26,92,125],"special":[6,58],"kind":[7],"of":[8,60,82,94,101,119,167],"single-source":[9],"single-sink":[10],"shortest":[11,74,114,136,165],"path":[12,75,137,166],"problem.":[13],"It":[14],"difficult":[16],"even":[17],"impossible":[18],"to":[19,71,78,91,97,105,162],"solve":[20,41,72,163],"the":[21,57,73,79,89,99,102,106,113,128,134,154,160,164],"large-scale":[22,51],"graphs":[24],"using":[25],"single":[27],"machine":[28],"with":[29],"sequential":[30],"algorithms.":[31],"There":[32],"are":[33,46],"many":[34],"distributed":[35],"computing":[37,95,108,144],"systems":[38],"that":[39,153],"can":[40,157],"this":[42],"problem,":[43],"but":[44],"they":[45],"often":[47],"designed":[48],"for":[49],"general":[50],"graphs,":[52],"which":[53],"do":[54],"not":[55],"consider":[56],"characteristics":[59,81],"graphs.":[62,84,169],"This":[63],"paper":[64],"proposes":[65],"DMGA":[66,111],"(Distributed":[67],"Multistage":[68],"Graph":[69],"Algorithm)":[70],"according":[77],"structural":[80],"algorithm":[86,156],"first":[87],"allocates":[88],"set":[93],"nodes":[96,145],"store":[98],"vertices":[100,123],"same":[103,107],"stage":[104],"node.":[109],"Next,":[110],"calculates":[112],"paths":[115],"between":[116,143],"any":[117],"pair":[118],"starting":[120],"and":[121],"ending":[122],"within":[124],"partition":[126],"by":[127,140],"classical":[129],"dynamic":[130],"programming":[131],"algorithm.":[132],"Finally,":[133],"global":[135],"calculated":[139],"subresults":[141],"exchanging":[142],"in":[146],"an":[147],"iterative":[148],"method.":[149],"Our":[150],"experiments":[151],"show":[152],"proposed":[155],"effectively":[158],"reduce":[159],"time":[161]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}