{"id":"https://openalex.org/W1976096628","doi":"https://doi.org/10.1002/net.3230230305","title":"Shortest paths in stochastic networks with ARC lengths having discrete distributions","display_name":"Shortest paths in stochastic networks with ARC lengths having discrete distributions","publication_year":1993,"publication_date":"1993-05-01","ids":{"openalex":"https://openalex.org/W1976096628","doi":"https://doi.org/10.1002/net.3230230305","mag":"1976096628"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230230305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230305","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5044693181","display_name":"Gehan A. Corea","orcid":null},"institutions":[{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gehan A. Corea","raw_affiliation_strings":["Department of Operations Research, SAS Institute Inc., Cary, North Carolina 27513"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, SAS Institute Inc., Cary, North Carolina 27513","institution_ids":["https://openalex.org/I122754148"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111584801","display_name":"Vidyadhar G. Kulkarni","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vidyadhar G. Kulkarni","raw_affiliation_strings":["Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina 27514"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina 27514","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.086,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.85463941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"23","issue":"3","first_page":"175","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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.9984999895095825,"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/T11476","display_name":"Graph theory and applications","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"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/arc","display_name":"Arc (geometry)","score":0.6854822635650635},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.4457114338874817},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44003167748451233},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42121443152427673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3957417905330658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3836250901222229},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33301499485969543},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1906236708164215},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.17091137170791626}],"concepts":[{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6854822635650635},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.4457114338874817},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44003167748451233},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42121443152427673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3957417905330658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3836250901222229},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33301499485969543},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1906236708164215},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.17091137170791626}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230230305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230305","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2002460920","https://openalex.org/W2007572995","https://openalex.org/W2030232685","https://openalex.org/W2048608180","https://openalex.org/W2055854241","https://openalex.org/W2061619051","https://openalex.org/W2062568266","https://openalex.org/W2074329090","https://openalex.org/W2084224084","https://openalex.org/W2087369687","https://openalex.org/W2099470650","https://openalex.org/W2104734478","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2373818241","https://openalex.org/W1967204917","https://openalex.org/W2368434553","https://openalex.org/W2092475372","https://openalex.org/W4248447025","https://openalex.org/W2482563509","https://openalex.org/W1994172230","https://openalex.org/W50580372","https://openalex.org/W145167312","https://openalex.org/W2364350605"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,73,93,102],"work,":[3],"we":[4],"compute":[5],"the":[6,11,68,78,88,111,120],"distribution":[7,80,112],"of":[8,13,92,113],"L":[9,83,114],"*,":[10],"length":[12],"a":[14,20,25,30,50,56],"shortest":[15],"(s,":[16],"t)":[17],"path,":[18],"in":[19,124],"directed":[21],"network":[22],"G":[23],"with":[24,55,63],"source":[26],"node":[27,32],"s":[28],"and":[29,34,60,100,116,126],"sink":[31],"t":[33],"whose":[35],"arc":[36],"lengths":[37],"are":[38,122,127],"independent,":[39],"nonnegative,":[40],"integer":[41],"valued":[42],"random":[43],"variables":[44],"having":[45],"finite":[46],"support.":[47],"We":[48,85],"construct":[49],"discrete":[51],"time":[52],"Markov":[53],"chain":[54,74,94],"single":[57],"absorbing":[58],"state":[59],"associate":[61],"costs":[62],"each":[64],"transition":[65,89],"such":[66],"that":[67,87],"total":[69],"cost":[70],"incurred":[71],"by":[72,129,134],"until":[75],"absorption":[76],"has":[77,95],"same":[79],"as":[81],"does":[82],"*.":[84],"show":[86],"probability":[90],"matrix":[91],"an":[96],"upper":[97],"triangular":[98],"structure":[99],"exploit":[101],"property":[103],"to":[104],"develop":[105],"numerically":[106],"stable":[107],"algorithms":[108,121],"for":[109],"computing":[110],"*":[115],"its":[117],"moments.":[118],"All":[119],"recursive":[123],"nature":[125],"illustrated":[128],"several":[130],"examples.":[131],"\u00a9":[132],"1993":[133],"John":[135],"Wiley":[136],"&":[137],"Sons,":[138],"Inc.":[139]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}