{"id":"https://openalex.org/W2105627622","doi":"https://doi.org/10.1002/net.3230130206","title":"Construction of centered shortest\u2010path trees in networks","display_name":"Construction of centered shortest\u2010path trees in networks","publication_year":1983,"publication_date":"1983-06-01","ids":{"openalex":"https://openalex.org/W2105627622","doi":"https://doi.org/10.1002/net.3230130206","mag":"2105627622"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130206","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130206","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/A5110229166","display_name":"David W. Wall","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David W. Wall","raw_affiliation_strings":["The Pennsylvania State University, University Park, Pennsylvania 16802"],"affiliations":[{"raw_affiliation_string":"The Pennsylvania State University, University Park, Pennsylvania 16802","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027346454","display_name":"Susan Owicki","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Susan Owicki","raw_affiliation_strings":["Stanford University, Stanford, California 94305,"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, California 94305,","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110229166"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.593,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7479898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"2","first_page":"207","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9995999932289124,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9995999932289124,"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/T11478","display_name":"Caching and Content Delivery","score":0.9995999932289124,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7795925140380859},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7411944270133972},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6667436957359314},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6123762130737305},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.566240131855011},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5538250803947449},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5501723885536194},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.5458250045776367},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5336748957633972},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42799875140190125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30367130041122437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17914164066314697},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10211041569709778},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09864494204521179},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.058593153953552246}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7795925140380859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7411944270133972},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6667436957359314},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6123762130737305},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.566240131855011},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5538250803947449},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5501723885536194},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5458250045776367},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5336748957633972},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42799875140190125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30367130041122437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17914164066314697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10211041569709778},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09864494204521179},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.058593153953552246},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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":"doi:10.1002/net.3230130206","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130206","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":6,"referenced_works":["https://openalex.org/W1502684340","https://openalex.org/W1583418977","https://openalex.org/W2016218947","https://openalex.org/W2043616829","https://openalex.org/W2096279854","https://openalex.org/W2150519657"],"related_works":["https://openalex.org/W3118505512","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W2359578922","https://openalex.org/W2996337372","https://openalex.org/W2376911392","https://openalex.org/W2388654557","https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W1985727224"],"abstract_inverted_index":{"Abstract":[0],"Many":[1],"researchers":[2],"in":[3,28,67,82],"the":[4,15,26,29,43,46,53,56],"area":[5],"of":[6,17,45,55],"distributed":[7],"networks":[8],"have":[9],"found":[10],"it":[11],"convenient":[12],"to":[13,24,78],"assume":[14],"existence":[16],"a":[18,83],"facility":[19],"for":[20,49],"routing":[21],"broadcast":[22],"messages":[23,41],"all":[25],"nodes":[27],"network.":[30,57],"We":[31],"are":[32],"investigating":[33],"an":[34],"approach":[35,65],"called":[36],"center\u2010based":[37],"forwarding":[38],"which":[39],"routes":[40],"via":[42],"branches":[44],"shortest\u2010path":[47],"tree":[48],"some":[50],"node":[51],"near":[52],"center":[54],"In":[58],"this":[59,64],"article":[60],"we":[61,74],"show":[62],"that":[63,69],"results":[66],"broadcasts":[68],"finish":[70],"with":[71],"low":[72],"delay;":[73],"then":[75],"explain":[76],"how":[77],"construct":[79],"centered":[80],"trees":[81],"loosely":[84],"coupled":[85],"network":[86],"environment.":[87]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}