{"id":"https://openalex.org/W75160977","doi":null,"title":"Efficient Algorithms for Single Link Failure Recovery and Its Application To Atm Networks","display_name":"Efficient Algorithms for Single Link Failure Recovery and Its Application To Atm Networks","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W75160977","mag":"75160977"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.394","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~bhosle/publications/slfr-pdcs03.ps","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W75160977"],"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/A5024662060","display_name":"Amit M. Bhosle","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amit M Bhosle","raw_affiliation_strings":["University of California Santa Barbara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Barbara","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075781836","display_name":"Teofilo F. Gonzalez","orcid":"https://orcid.org/0009-0009-8211-4135","observed_orcids":["https://orcid.org/0009-0009-8211-4135"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Teofilo F Gonzalez","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024662060"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_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":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.0,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.0,"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/alternate-path-routing","display_name":"alternate path routing","score":0.9549999833106995},{"id":"https://openalex.org/keywords/atm-networks","display_name":"ATM networks","score":0.9990000128746033},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8700000047683716},{"id":"https://openalex.org/keywords/biconnected-graphs","display_name":"2-connected graphs","score":0.9319999814033508},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.6129999756813049},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7279999852180481},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.5090000033378601}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5506899356842041},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5310236215591431},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.517920196056366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5132040977478027},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5129141807556152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5056717395782471},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5003728866577148},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47367149591445923},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4341215491294861},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4227924942970276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3879803717136383},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1556800901889801},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.394","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~bhosle/publications/slfr-pdcs03.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.5454","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.5454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~bhosle/publications/BhosleGonzalez2004.8.3.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W32552433","https://openalex.org/W1673477340","https://openalex.org/W1978715699","https://openalex.org/W1982842799","https://openalex.org/W1986261983","https://openalex.org/W2011999472","https://openalex.org/W2028503265","https://openalex.org/W2032841680","https://openalex.org/W2049774319","https://openalex.org/W2084224084","https://openalex.org/W2096594665","https://openalex.org/W2157578392","https://openalex.org/W2164485560"],"related_works":["https://openalex.org/W2132422341","https://openalex.org/W2025082755","https://openalex.org/W2140881185","https://openalex.org/W2020619470","https://openalex.org/W2001540500","https://openalex.org/W2102408826","https://openalex.org/W7097854169","https://openalex.org/W2157578392","https://openalex.org/W2071324569","https://openalex.org/W2109998612"],"abstract_inverted_index":{"We":[0,84,136,169],"investigate":[1],"the":[2,12,21,73,103,111,129,148,155,162,175,185,196,206,210],"single":[3,176,197],"link":[4,177,198],"failure":[5,199],"recovery":[6,178,200],"problem":[7,16,96,153,179,189,201],"and":[8,20,43,60,97],"its":[9],"application":[10],"to":[11,70,132,174,183,204],"alternate":[13,186],"path":[14,67,156,187],"routing":[15,188],"for":[17,24,76,94,102,147,195,209],"ATM":[18,191],"networks,":[19],"k-replacement":[22,207],"edges":[23,208,212],"each":[25],"edge":[26,112],"of":[27,53,141,151,167,213],"a":[28,35,39,44,65,98,138,214],"minimum":[29,215],"cost":[30,216],"spanning":[31,217],"tree.":[32],"Specifically,":[33],"given":[34],"2-connected":[36],"graph":[37,74],"G,":[38],"specified":[40],"node":[41],"s,":[42,54],"shortest":[45,66,163],"paths":[46,164],"tree":[47,166,211,218],"Ts":[48,160],"=":[49,57,62],"{e1,":[50],"e2,...,":[51],"en\u22121}":[52],"where":[55,126,159],"ei":[56],"(xi,":[58],"yi)":[59],"xi":[61],"parentTs(yi),":[63],"find":[64,205],"from":[68],"yi":[69],"s":[71],"in":[72,190,219],"G\\\\ei":[75],"1":[77],"\u2264":[78,80],"i":[79],"n":[81,89,134,145],"\u2212":[82],"1.":[83],"present":[85,117],"an":[86,118],"O(m":[87,122,220],"+":[88,123,221],"log":[90],"n)":[91,223],"time":[92,100,130],"algorithm":[93,101,119],"this":[95],"linear":[99],"case":[104],"when":[105],"all":[106],"weights":[107,113],"are":[108,114],"equal.":[109],"When":[110],"integers,":[115],"we":[116],"that":[120,171],"takes":[121],"Tsort(n))":[124],"time,":[125],"Tsort(n)":[127],"is":[128,161,202],"required":[131],"sort":[133],"integers.":[135],"establish":[137],"lower":[139],"bound":[140],"\u2126(min(m":[142],"\u221a":[143],"n,":[144],"2))":[146],"directed":[149],"version":[150],"our":[152],"under":[154],"comparison":[157],"model,":[158],"destination":[165],"s.":[168],"show":[170],"any":[172],"solution":[173],"can":[180],"be":[181],"adapted":[182,203],"solve":[184],"networks.":[192],"Our":[193],"technique":[194],"nlog":[222],"time.":[224]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W75160977","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
