{"id":"https://openalex.org/W2044980003","doi":"https://doi.org/10.1080/10637199408915459","title":"A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM","display_name":"A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2044980003","doi":"https://doi.org/10.1080/10637199408915459","mag":"2044980003"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915459","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915459","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5091570394","display_name":"Srinivasan Chandrasekar","orcid":"https://orcid.org/0000-0003-2060-6029"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"SRINIVASAN CHANDRASEKAR","raw_affiliation_strings":["Department of Computer Science , Colorado State University , Ft., Collins, CO, 80523, USA","Department of Computer Science, Colorado State University Ft. Collins, CO 80523, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Colorado State University , Ft., Collins, CO, 80523, USA","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Department of Computer Science, Colorado State University Ft. Collins, CO 80523, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047296304","display_name":"Pradip K. Srimani","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"PRADIP K. SRIMANI","raw_affiliation_strings":["Department of Computer Science , Colorado State University , Ft., Collins, CO, 80523, USA","Department of Computer Science, Colorado State University Ft. Collins, CO 80523, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Colorado State University , Ft., Collins, CO, 80523, USA","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Department of Computer Science, Colorado State University Ft. Collins, CO 80523, USA","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091570394"],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":1.0773,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.80229582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"1-2","first_page":"125","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9585999846458435,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9513999819755554,"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/correctness","display_name":"Correctness","score":0.7914934158325195},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6743313670158386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6047987937927246},{"id":"https://openalex.org/keywords/self-stabilization","display_name":"Self-stabilization","score":0.5099579095840454},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5066433548927307},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.48545438051223755},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.44578492641448975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44508597254753113},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4384270906448364},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.42989349365234375},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41476181149482727},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.37423017621040344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36449676752090454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3621819019317627},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3232905864715576},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21415776014328003},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.17754095792770386}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7914934158325195},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6743313670158386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6047987937927246},{"id":"https://openalex.org/C71112949","wikidata":"https://www.wikidata.org/wiki/Q2873036","display_name":"Self-stabilization","level":3,"score":0.5099579095840454},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5066433548927307},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.48545438051223755},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.44578492641448975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44508597254753113},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4384270906448364},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.42989349365234375},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41476181149482727},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.37423017621040344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36449676752090454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3621819019317627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3232905864715576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21415776014328003},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.17754095792770386},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408915459","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915459","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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":11,"referenced_works":["https://openalex.org/W1586312434","https://openalex.org/W1970730976","https://openalex.org/W2055126916","https://openalex.org/W2055164757","https://openalex.org/W2062904677","https://openalex.org/W2063615214","https://openalex.org/W2111132249","https://openalex.org/W2145786150","https://openalex.org/W2163350150","https://openalex.org/W2294012738","https://openalex.org/W2914863966"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2170980056","https://openalex.org/W2348177054","https://openalex.org/W2136320479","https://openalex.org/W1508906807","https://openalex.org/W4285816407","https://openalex.org/W2886722595","https://openalex.org/W2359507849"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"a":[5,32],"simple":[6,48],"and":[7,49],"elegant":[8],"distributed":[9],"self-stabilizing":[10,42,56],"algorithm":[11,29],"to":[12,51],"solve":[13],"the":[14,25,44],"all-pairs":[15],"shortest":[16],"path":[17],"problem":[18],"in":[19,54],"graph":[20],"theory.":[21],"We":[22],"have":[23,52],"proved":[24],"correctness":[26,40],"of":[27,41],"our":[28],"without":[30],"using":[31],"bounded":[33],"function":[34],"(which":[35],"is":[36,47],"customary":[37],"for":[38,58],"proving":[39],"algorithms);":[43],"new":[45],"approach":[46],"seems":[50],"potential":[53],"developing":[55],"algorithms":[57],"other":[59],"graph-theoretical":[60],"problems.":[61]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}