{"id":"https://openalex.org/W2180954823","doi":null,"title":"Randomized shortest paths and their applications","display_name":"Randomized shortest paths and their applications","alternate_titles":[],"publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2180954823","mag":"2180954823"},"language":"en","primary_location":{"id":"mag:2180954823","doi":null,"is_oa":false,"landing_page_url":"https://dial.uclouvain.be/pr/boreal/object/boreal:165618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2180954823"],"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/A5032862758","display_name":"Silvia Garc\u00eda D\u00edez","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Silvia Garc\u00eda D\u00edez","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5032862758"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.4722000062465668,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.4722000062465668,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.3122999966144562,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.18520000576972961,"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","display_name":"shortest path","score":0.9409999847412109},{"id":"https://openalex.org/keywords/graph-distance-measures","display_name":"graph distance measures","score":0.7799999713897705},{"id":"https://openalex.org/keywords/node-connectivity","display_name":"node connectivity","score":0.8130000233650208},{"id":"https://openalex.org/keywords/graph-analysis","display_name":"graph analysis","score":0.4699999988079071},{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.6060000061988831},{"id":"https://openalex.org/keywords/social-network-analysis","display_name":"social network analysis","score":0.6420000195503235},{"id":"https://openalex.org/keywords/biological-sequence-alignment","display_name":"biological sequence alignment","score":0.7200000286102295},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"speech recognition","score":0.7580000162124634}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8284881711006165},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.5532941222190857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5458028316497803},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5227956175804138},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49384766817092896},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49055713415145874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4805908203125},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.46080613136291504},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.424974262714386},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.420086532831192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.419898122549057},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.414937287569046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37665650248527527},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.32581502199172974},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0762249231338501},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2180954823","doi":null,"is_oa":false,"landing_page_url":"https://dial.uclouvain.be/pr/boreal/object/boreal:165618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7065168096","https://openalex.org/W2065229575","https://openalex.org/W143679896","https://openalex.org/W844477705","https://openalex.org/W2019854450","https://openalex.org/W2988816816","https://openalex.org/W3135613777","https://openalex.org/W2122597713","https://openalex.org/W3205072046","https://openalex.org/W2185114784"],"abstract_inverted_index":{"In":[0],"graph":[1],"analysis,":[2,37],"the":[3,8,21,49,54,73,77,85,116,128,149],"Shortest":[4,118],"Path":[5,119],"problem":[6,18,168],"identifies":[7],"optimal,":[9],"most":[10],"cost":[11,56],"effective,":[12],"path":[13,41,51],"between":[14,110],"two":[15,82],"nodes.":[16,83],"This":[17],"has":[19],"been":[20],"object":[22],"of":[23,57,79,81,106,136],"many":[24],"studies":[25],"and":[26,163],"extensions":[27],"in":[28,158],"heterogeneous":[29],"domains":[30,157],"such":[31,75],"as:":[32],"speech":[33],"recognition,":[34],"social":[35],"network":[36],"biological":[38],"sequence":[39],"alignment,":[40],"planning,":[42],"or":[43,173],"zero-sum":[44],"games":[45],"among":[46],"others.":[47],"Although":[48],"shortest":[50],"focuses":[52],"on":[53,72],"optimal":[55],"reaching":[58],"a":[59,126,170],"destination":[60],"node,":[61],"it":[62],"does":[63],"not":[64],"take":[65],"into":[66,92],"account":[67,93],"other":[68,86],"useful":[69],"information":[70,91],"contained":[71],"graph,":[74,127],"as":[76],"degree":[78,135],"connectivity":[80,90],"On":[84],"hand,":[87],"measures":[88],"taking":[89],"have":[94],"their":[95],"own":[96],"drawbacks,":[97],"specially":[98],"when":[99],"graphs":[100],"become":[101],"large.":[102],"A":[103],"new":[104,171],"family":[105],"distances":[107],"which":[108,159],"interpolates":[109],"both":[111],"extremes":[112],"is":[113,161],"introduced":[114],"by":[115],"Randomized":[117],"(RSP)":[120],"framework.":[121],"By":[122],"spreading":[123],"randomization":[124,160],"through":[125],"RSP":[129,150],"leads":[130],"to":[131,146,155,175],"applications":[132],"where":[133],"some":[134],"randomness":[137],"would":[138],"be":[139,153],"desired.":[140],"Through":[141],"this":[142],"work,":[143],"we":[144],"try":[145],"investigate":[147],"whether":[148],"framework":[151],"can":[152],"applied":[154],"different":[156],"useful,":[162],"either":[164],"solve":[165],"an":[166],"existing":[167,177],"with":[169],"approach,":[172],"prove":[174],"outperform":[176],"methods.":[178]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2180954823","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
