{"id":"https://openalex.org/W2624028303","doi":"https://doi.org/10.1145/3078447.3078460","title":"Finding Top K Shortest Simple Paths with Improved Space Efficiency","display_name":"Finding Top K Shortest Simple Paths with Improved Space Efficiency","publication_year":2017,"publication_date":"2017-05-19","ids":{"openalex":"https://openalex.org/W2624028303","doi":"https://doi.org/10.1145/3078447.3078460","mag":"2624028303"},"language":"en","primary_location":{"id":"doi:10.1145/3078447.3078460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3078447.3078460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048346353","display_name":"Qingsong Wen","orcid":"https://orcid.org/0000-0003-4516-2524"},"institutions":[{"id":"https://openalex.org/I4210146936","display_name":"Huawei Technologies (United States)","ror":"https://ror.org/03jyqk712","country_code":"US","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210146936"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qingsong Wen","raw_affiliation_strings":["Huawei Research America, Santa Clara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Research America, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I4210146936"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100616782","display_name":"Ren Chen","orcid":"https://orcid.org/0000-0003-3501-7630"},"institutions":[{"id":"https://openalex.org/I4210146936","display_name":"Huawei Technologies (United States)","ror":"https://ror.org/03jyqk712","country_code":"US","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210146936"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ren Chen","raw_affiliation_strings":["Huawei Research America, Santa Clara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Research America, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I4210146936"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016524466","display_name":"Lifeng Nai","orcid":"https://orcid.org/0000-0002-8801-9384"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lifeng Nai","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100452292","display_name":"L. P. Zhou","orcid":"https://orcid.org/0000-0001-6989-8080"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li Zhou","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103733183","display_name":"Yinglong Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I4210146936","display_name":"Huawei Technologies (United States)","ror":"https://ror.org/03jyqk712","country_code":"US","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210146936"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinglong Xia","raw_affiliation_strings":["Huawei Research America, Santa Clara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Research America, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I4210146936"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9975000023841858,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7197879552841187},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.7036063075065613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6690274477005005},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6206094622612},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6141341328620911},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.54929119348526},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5481668710708618},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5374586582183838},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5092207193374634},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.470842570066452},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45354145765304565},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42913100123405457},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3914618492126465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3184497654438019},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31707364320755005},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15709948539733887}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7197879552841187},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.7036063075065613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6690274477005005},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6206094622612},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6141341328620911},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.54929119348526},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5481668710708618},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5374586582183838},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5092207193374634},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.470842570066452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45354145765304565},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42913100123405457},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3914618492126465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3184497654438019},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31707364320755005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15709948539733887},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3078447.3078460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3078447.3078460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1970543907","https://openalex.org/W1975274780","https://openalex.org/W2011282943","https://openalex.org/W2059198010","https://openalex.org/W2060194699","https://openalex.org/W2078948975","https://openalex.org/W2087667622","https://openalex.org/W2089845007","https://openalex.org/W2112643276","https://openalex.org/W2131058166","https://openalex.org/W2156858199","https://openalex.org/W2169528473","https://openalex.org/W2277605219","https://openalex.org/W2280644296","https://openalex.org/W2508516675"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2372677512","https://openalex.org/W2348177054","https://openalex.org/W1508906807","https://openalex.org/W2147862592","https://openalex.org/W2387829241","https://openalex.org/W2388977121","https://openalex.org/W2173748631"],"abstract_inverted_index":{"Finding":[0],"top-K":[1,46],"shortest":[2,34,47,107,149],"paths":[3,35,124,150],"is":[4,52],"fundamental":[5],"and":[6,21,56,81,143,175,181,188,215],"crucial":[7],"to":[8,14,37,87,115,191,207],"many":[9],"graph":[10,19],"applications,":[11],"but":[12],"known":[13],"be":[15,38,113,152],"nontrivial":[16],"over":[17],"large":[18,22],"data":[20],"value":[23],"of":[24,101,119,137,172,186],"K.":[25],"This":[26],"problem":[27],"becomes":[28],"much":[29],"more":[30],"challenging":[31],"when":[32],"the":[33,61,78,83,88,99,106,116,128,135,148,156,168,192],"require":[36],"simple":[39,48],"(paths":[40],"without":[41,159],"loops).":[42],"When":[43],"searching":[44],"for":[45],"paths,":[49],"MPS":[50,72,90,130,194,202],"algorithm":[51,73,203],"a":[53,95],"practically":[54],"fast":[55],"efficient":[57],"scheme":[58,97],"based":[59],"on":[60],"famous":[62],"Yen's":[63],"algorithm.":[64,91,131],"In":[65],"this":[66],"paper,":[67],"we":[68,93,133,166],"propose":[69],"an":[70],"improved":[71,201],"which":[74],"can":[75,151,204],"significantly":[76],"reduce":[77],"memory":[79,176,216],"consumption":[80,177],"increase":[82],"execution":[84],"speed":[85],"compared":[86],"original":[89,129,193],"First,":[92],"design":[94],"pruning":[96],"during":[98],"construction":[100],"pseudo-tree,":[102,117],"such":[103,146],"that":[104,126,147,199],"only":[105],"path":[108],"in":[109,127,170,178,211],"each":[110],"iteration":[111],"would":[112],"added":[114],"instead":[118],"adding":[120],"all":[121,162],"possible":[122],"candidate":[123,163],"as":[125],"Second,":[132],"modify":[134],"pseudo-tree":[136,158],"shortest-path":[138],"candidates":[139],"with":[140,184],"reversed":[141],"order":[142],"internal":[144],"ID,":[145],"retrieved":[153],"directly":[154],"from":[155],"constructed":[157],"explicitly":[160],"storing":[161],"paths.":[164],"Furthermore,":[165],"evaluate":[167],"performance":[169,209],"terms":[171],"running":[173,213],"time":[174,214],"both":[179,212],"synthetic":[180],"real":[182],"graphs":[183],"millions":[185],"vertices":[187],"edges.":[189],"Compared":[190],"algorithm,":[195],"experimental":[196],"results":[197],"show":[198],"our":[200],"bring":[205],"up":[206],"6x":[208],"gain":[210],"consumption.":[217]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}