{"id":"https://openalex.org/W7100350232","doi":null,"title":"Parallel Algorithms for the k Shortest Paths and Related Problems","display_name":"Parallel Algorithms for the k Shortest Paths and Related Problems","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7100350232"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.1711","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.1711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~ruppert/thesis.ps.gz","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7100350232"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5005008149","display_name":"Eric Ruppert","orcid":"https://orcid.org/0000-0001-5613-8701","observed_orcids":["https://orcid.org/0000-0001-5613-8701"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Eric Ruppert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5005008149"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940999746322632,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.003100000089034438,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-shortest-paths","display_name":"k-shortest paths","score":0.9909999966621399},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9860000014305115},{"id":"https://openalex.org/keywords/pram","display_name":"PRAM","score":0.8640000224113464},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"shortest path tree","score":0.7749999761581421},{"id":"https://openalex.org/keywords/rank-based-selection","display_name":"rank selection","score":0.6140000224113464},{"id":"https://openalex.org/keywords/viterbi-decoding","display_name":"Viterbi decoding","score":0.9169999957084656},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.796999990940094},{"id":"https://openalex.org/keywords/markov-processes","display_name":"Markov processes","score":0.8859999775886536}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6358000040054321},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6191999912261963},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5771999955177307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5533999800682068},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5116999745368958},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5019000172615051},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49059998989105225},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46630001068115234},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.44850000739097595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4366999864578247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4020000100135803},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.38580000400543213},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.3280999958515167},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3248000144958496},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31779998540878296},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.31439998745918274},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.29120001196861267},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.27959999442100525},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.25290000438690186},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.1711","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.1711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~ruppert/thesis.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3134498349","https://openalex.org/W1549783832","https://openalex.org/W2092090659","https://openalex.org/W2371482997","https://openalex.org/W2132627882","https://openalex.org/W3155826337","https://openalex.org/W2181667938","https://openalex.org/W7099118493","https://openalex.org/W140737195","https://openalex.org/W2072016939"],"abstract_inverted_index":{"A":[0],"parallel":[1,142],"algorithm":[2,32,136,148],"is":[3,24,92,137],"developed":[4],"to":[5,42,139],"find":[6,158],"the":[7,27,38,90,104,119,122,150,159],"k":[8,39,70,72,77,133],"shortest":[9,40,85,134],"paths":[10,41,135],"between":[11],"pairs":[12],"of":[13,29,37,50,103,106,110,121,144,164],"vertices":[14,55],"in":[15,126],"an":[16,34,108,114],"edge-weighted":[17],"directed":[18],"graph.":[19],"The":[20,31,132],"concurrent-read":[21],"exclusive-write":[22],"PRAM":[23],"used":[25],"as":[26],"model":[28],"computation.":[30],"computes":[33],"implicit":[35],"representation":[36],"a":[43,51,84,100,127,141,145,165],"given":[44,111,168],"destination":[45,91],"vertex":[46,49],"from":[47,113],"each":[48],"graph":[52],"with":[53,129],"n":[54],"and":[56,67,117],"m":[57],"edges,":[58],"using":[59],"O(m":[60],"+":[61,73,78],"nk":[62],"log":[63,71,74,76,79],"2":[64],"k)":[65],"work":[66],"O(log":[68],"3":[69],"n(log":[75],"n))":[80],"time,":[81],"assuming":[82],"that":[83],"path":[86],"tree":[87],"rooted":[88],"at":[89],"precomputed.":[93],"Parallel":[94],"algorithms":[95],"are":[96],"also":[97],"described":[98],"for":[99,118,149],"weighted":[101],"version":[102],"problem":[105],"selecting":[107],"element":[109,125],"rank":[112],"unsorted":[115],"array":[116],"selection":[120],"kth":[123],"smallest":[124],"matrix":[128],"sorted":[130],"columns.":[131],"applied":[138],"obtain":[140],"implementation":[143],"dynamic":[146],"programming":[147],"list":[151],"Viterbi":[152],"decoding":[153],"problem,":[154],"where":[155],"one":[156],"must":[157],"most":[160],"probable":[161],"state":[162],"sequences":[163],"Markov":[166],"process,":[167],"noisy":[169],"obser...":[170]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7100350232","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
