{"id":"https://openalex.org/W2157128732","doi":"https://doi.org/10.1002/net.3230130204","title":"A note on Arc tolerances in sparse shortest\u2010path and network flow problems","display_name":"A note on Arc tolerances in sparse shortest\u2010path and network flow problems","publication_year":1983,"publication_date":"1983-06-01","ids":{"openalex":"https://openalex.org/W2157128732","doi":"https://doi.org/10.1002/net.3230130204","mag":"2157128732"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130204","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/A5062896251","display_name":"Dan Gusfield","orcid":"https://orcid.org/0000-0002-7469-5103"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dan Gusfield","raw_affiliation_strings":["Department of Computer Science, Yale University, New Haven, Connecticut 06520"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven, Connecticut 06520","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062896251"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.29056685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"2","first_page":"191","last_page":"196"},"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.998199999332428,"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.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"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/arc","display_name":"Arc (geometry)","score":0.7729989290237427},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7262117862701416},{"id":"https://openalex.org/keywords/tracing","display_name":"Tracing","score":0.6265323758125305},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5067346692085266},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49413684010505676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4866214692592621},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48448583483695984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4796629250049591},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47033390402793884},{"id":"https://openalex.org/keywords/spacetime","display_name":"Spacetime","score":0.44508785009384155},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43784815073013306},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4151419699192047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4031546711921692},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12892210483551025},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08087041974067688}],"concepts":[{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.7729989290237427},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7262117862701416},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.6265323758125305},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5067346692085266},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49413684010505676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4866214692592621},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48448583483695984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4796629250049591},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47033390402793884},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.44508785009384155},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43784815073013306},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4151419699192047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4031546711921692},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12892210483551025},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08087041974067688},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130204","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1986022261","https://openalex.org/W2022363559","https://openalex.org/W2048500523"],"related_works":["https://openalex.org/W2888673113","https://openalex.org/W2056065966","https://openalex.org/W2062641654","https://openalex.org/W2352602608","https://openalex.org/W2544839741","https://openalex.org/W3023262859","https://openalex.org/W2212288070","https://openalex.org/W3213987435","https://openalex.org/W1517786189","https://openalex.org/W2367675495"],"abstract_inverted_index":{"Abstract":[0],"In":[1,102,123],"the":[2,32,50,72,86,109,124,134],"article":[3],"\u201cArc":[4],"Tolerances":[5],"in":[6,38],"Shortest\u2010Path":[7],"and":[8,16,45,63,69,118],"Network":[9],"Flow":[10],"Problems\u201d":[11],"by":[12],"D.":[13],"R.":[14],"Shier":[15],"C.":[17],"Witzgall,":[18],"several":[19],"methods":[20,94,111],"were":[21],"described":[22,113],"to":[23,26,56,77],"compute,":[24],"relative":[25],"a":[27,39,129],"given":[28],"tree":[29],"T":[30],",":[31],"\u201carc":[33],"tolerance\u201d":[34],"of":[35,42,89,106,108],"each":[36],"arc":[37],"graph":[40],"G":[41],"n":[43],"nodes":[44],"A":[46],"arcs.":[47],"One":[48],"method,":[49,71],"\u201cdead\u2010end":[51],"retraction\u201d":[52],"method":[53,74,126],"was":[54,75],"shown":[55,76],"take":[57,78],"O":[58,64],"(n":[59,65],"2":[60,66],")":[61,67],"time":[62,80],"space,":[68],"another":[70],"\u201ccycle\u2010tracing\u201d":[73],"O(nA)":[79],"but":[81],"only":[82],"O(A)":[83,116,119],"space.":[84,101],"For":[85],"important":[87],"case":[88],"large":[90],"sparse":[91],"graphs,":[92],"these":[93],"either":[95],"require":[96,115],"excessive":[97,100],"time,":[98],"or":[99],"this":[103,127],"note":[104],"implementations":[105],"both":[107],"above":[110],"are":[112],"which":[114],"space":[117],"log":[120],"n)":[121],"time.":[122],"cycle\u2010tracing":[125],"is":[128],"strict":[130],"improvement":[131],"even":[132],"for":[133],"dense":[135],"case.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}