{"id":"https://openalex.org/W4388031360","doi":"https://doi.org/10.1145/3581784.3607110","title":"PeeK: A Prune-Centric Approach for K Shortest Path Computation","display_name":"PeeK: A Prune-Centric Approach for K Shortest Path Computation","publication_year":2023,"publication_date":"2023-10-30","ids":{"openalex":"https://openalex.org/W4388031360","doi":"https://doi.org/10.1145/3581784.3607110"},"language":"en","primary_location":{"id":"doi:10.1145/3581784.3607110","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3581784.3607110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"type":"article","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/A5101982204","display_name":"Wang Feng","orcid":"https://orcid.org/0009-0004-5960-7584"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wang Feng","raw_affiliation_strings":["University of North Texas, Denton, United States of America"],"affiliations":[{"raw_affiliation_string":"University of North Texas, Denton, United States of America","institution_ids":["https://openalex.org/I123534392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016169662","display_name":"Shiyang Chen","orcid":"https://orcid.org/0000-0003-2626-7865"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shiyang Chen","raw_affiliation_strings":["Rutgers University, New Brunswick, United States of America"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, United States of America","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100623301","display_name":"Hang Liu","orcid":"https://orcid.org/0000-0001-6323-7388"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hang Liu","raw_affiliation_strings":["Rutgers University, New Brunswick, United States of America"],"affiliations":[{"raw_affiliation_string":"Rutgers University, New Brunswick, United States of America","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066436066","display_name":"Yuede Ji","orcid":"https://orcid.org/0000-0002-2419-6592"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuede Ji","raw_affiliation_strings":["University of North Texas, Denton, United States of America"],"affiliations":[{"raw_affiliation_string":"University of North Texas, Denton, United States of America","institution_ids":["https://openalex.org/I123534392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101982204"],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":null,"apc_paid":null,"fwci":1.54,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82192211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9591000080108643,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.9577999711036682,"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.8489253520965576},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.6973181366920471},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5793169736862183},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5566295385360718},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5507869124412537},{"id":"https://openalex.org/keywords/peek","display_name":"Peek","score":0.49784016609191895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48062700033187866},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.46503323316574097},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43609383702278137},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.43205100297927856},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43038463592529297},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3910137116909027},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3422279953956604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28612715005874634},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07677286863327026}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8489253520965576},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.6973181366920471},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5793169736862183},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5566295385360718},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5507869124412537},{"id":"https://openalex.org/C7660682","wikidata":"https://www.wikidata.org/wiki/Q7160167","display_name":"Peek","level":3,"score":0.49784016609191895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48062700033187866},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.46503323316574097},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43609383702278137},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.43205100297927856},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43038463592529297},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3910137116909027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3422279953956604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28612715005874634},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07677286863327026},{"id":"https://openalex.org/C521977710","wikidata":"https://www.wikidata.org/wiki/Q81163","display_name":"Polymer","level":2,"score":0.0},{"id":"https://openalex.org/C46141821","wikidata":"https://www.wikidata.org/wiki/Q209402","display_name":"Nuclear magnetic resonance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3581784.3607110","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3581784.3607110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W814515578","https://openalex.org/W1482680420","https://openalex.org/W1970543907","https://openalex.org/W1984407615","https://openalex.org/W1992114977","https://openalex.org/W1999545213","https://openalex.org/W2007223965","https://openalex.org/W2011282943","https://openalex.org/W2019151457","https://openalex.org/W2046565312","https://openalex.org/W2057112598","https://openalex.org/W2061632451","https://openalex.org/W2073296515","https://openalex.org/W2084243524","https://openalex.org/W2089845007","https://openalex.org/W2094099891","https://openalex.org/W2105547707","https://openalex.org/W2109329702","https://openalex.org/W2114507260","https://openalex.org/W2122867585","https://openalex.org/W2126004407","https://openalex.org/W2143884249","https://openalex.org/W2147418091","https://openalex.org/W2154111453","https://openalex.org/W2154782854","https://openalex.org/W2167168675","https://openalex.org/W2240933082","https://openalex.org/W2270136648","https://openalex.org/W2432978112","https://openalex.org/W2532262311","https://openalex.org/W2590157914","https://openalex.org/W2734370244","https://openalex.org/W2734941459","https://openalex.org/W2779465503","https://openalex.org/W2885747357","https://openalex.org/W2902940306","https://openalex.org/W2963212338","https://openalex.org/W2997848713","https://openalex.org/W3005414731","https://openalex.org/W3121082296","https://openalex.org/W3175994815","https://openalex.org/W4210896998","https://openalex.org/W4242704962","https://openalex.org/W4281666535","https://openalex.org/W4283377648","https://openalex.org/W4283399957","https://openalex.org/W4285092328","https://openalex.org/W4384129390"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2347245430","https://openalex.org/W651485002","https://openalex.org/W4293054712","https://openalex.org/W2094515718","https://openalex.org/W2198982833","https://openalex.org/W2100214387","https://openalex.org/W2163460271","https://openalex.org/W2170980056","https://openalex.org/W2170628445"],"abstract_inverted_index":{"The":[0],"K":[1,10,38,85,94,115],"shortest":[2,11,39,71,86,95],"path":[3],"(KSP)":[4],"algorithm,":[5],"which":[6],"finds":[7],"the":[8,36,60,89,103],"top":[9,37,93],"simple":[12,40],"paths":[13,41,72,87,96],"from":[14,88],"a":[15,18,22,52,99,111],"source":[16],"to":[17,68],"target":[19],"vertex,":[20],"has":[21],"wide":[23],"range":[24],"of":[25,102],"real-world":[26],"applications,":[27],"e.g.,":[28,106],"routing,":[29],"vulnerability":[30],"detection,":[31],"and":[32,57],"biology":[33],"analysis.":[34],"While":[35],"offer":[42],"invaluable":[43],"insights,":[44],"computing":[45],"them":[46],"is":[47,81],"time-consuming.":[48],"For":[49],"example,":[50],"on":[51,110],"Twitter":[53,112],"graph":[54,113],"(61.6M":[55],"vertices":[56],"1.5B":[58],"edges),":[59],"best":[61],"parallel":[62],"method":[63],"needs":[64],"about":[65],"20":[66],"minutes":[67],"get":[69],"128":[70],"between":[73],"two":[74],"vertices.":[75],"A":[76],"key":[77],"observation":[78],"we":[79],"made":[80],"existing":[82],"works":[83],"search":[84],"original":[90,104],"graph,":[91,105],"while":[92],"only":[97],"cover":[98],"meager":[100],"portion":[101],"less":[107],"than":[108],"0.001%":[109],"for":[114],"=":[116],"128.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}