{"id":"https://openalex.org/W2039498863","doi":"https://doi.org/10.1137/0218058","title":"Efficient Message Routing in Planar Networks","display_name":"Efficient Message Routing in Planar Networks","publication_year":1989,"publication_date":"1989-08-01","ids":{"openalex":"https://openalex.org/W2039498863","doi":"https://doi.org/10.1137/0218058","mag":"2039498863"},"language":"en","primary_location":{"id":"doi:10.1137/0218058","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218058","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":["Purdue Univ., West LaFayette, IN"],"affiliations":[{"raw_affiliation_string":"Purdue Univ., West LaFayette, IN","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050894676","display_name":"Ravi Janardan","orcid":"https://orcid.org/0000-0003-3922-6763"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Janardan","raw_affiliation_strings":["University of Minnesota, Minneapolis,#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis,#TAB#","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.9229,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.90517129,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"18","issue":"4","first_page":"843","last_page":"857"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/combinatorics","display_name":"Combinatorics","score":0.6140525341033936},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5941137075424194},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5930770039558411},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5756814479827881},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5571460723876953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.550896167755127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47155070304870605},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4636823534965515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4628734886646271},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4496206045150757},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.31489574909210205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11421072483062744}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6140525341033936},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5941137075424194},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5930770039558411},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5756814479827881},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5571460723876953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.550896167755127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47155070304870605},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4636823534965515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4628734886646271},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4496206045150757},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31489574909210205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11421072483062744},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","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":1,"locations":[{"id":"doi:10.1137/0218058","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218058","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":15,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1508053042","https://openalex.org/W1511174345","https://openalex.org/W2014411916","https://openalex.org/W2038643780","https://openalex.org/W2040391409","https://openalex.org/W2049413646","https://openalex.org/W2049706063","https://openalex.org/W2063048655","https://openalex.org/W2073840571","https://openalex.org/W2090972269","https://openalex.org/W2120424341","https://openalex.org/W2151358465","https://openalex.org/W2914484629","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W4206327962","https://openalex.org/W2010009304","https://openalex.org/W1996851061","https://openalex.org/W3021694725","https://openalex.org/W2025195393","https://openalex.org/W2940695648","https://openalex.org/W1973684381","https://openalex.org/W2096304864","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,25,51,60,86,92,133,152,164],"routing":[3,15,44,93],"messages":[4],"along":[5],"near-shortest":[6],"paths":[7],"in":[8,63,113],"a":[9,84,161],"distributed":[10],"network":[11,27,38],"without":[12],"using":[13],"complete":[14],"tables":[16],"is":[17,20,39],"considered.":[18],"It":[19],"assumed":[21],"that":[22,103],"the":[23,26,35,37,49,57,65,70,76,125,129,150,167],"nodes":[24],"can":[28],"be":[29],"assigned":[30],"suitable":[31],"short":[32],"names":[33,67,82,159],"at":[34,149],"time":[36],"established.":[40],"Two":[41],"space-efficient":[42],"near-shortest-path":[43],"schemes":[45,55],"are":[46,104],"given":[47],"for":[48],"class":[50],"planar":[52,61],"networks.":[53],"Both":[54],"use":[56],"separator":[58],"property":[59],"networks":[62],"assigning":[64],"node":[66,158],"and":[68,83,160],"performing":[69],"routings.":[71,168],"For":[72,116],"an":[73],"n-node":[74],"network,":[75],"first":[77],"scheme":[78,127],"uses":[79],"$O(\\log":[80,96],"n)$-bit":[81,157],"total":[85],"$O(n^{{4":[87],"/":[88,142,154],"3}}":[89],")$":[90,138],"items":[91],"information,":[94],"each":[95,140],"n)$":[97,145],"bits":[98,146],"long,":[99,147],"to":[100],"generate":[101],"routings":[102,112],"only":[105],"three":[106],"times":[107],"longer":[108],"than":[109],"corresponding":[110],"shortest":[111],"worst":[114],"cases.":[115],"any":[117],"constant":[118],"$\\epsilon":[119],",0":[120],"<":[121,123],"\\epsilon":[122,136,143,155],"1/3$,":[124],"second":[126],"achieves":[128],"better":[130],"space":[131],"bound":[132,163],"$O(n^{1":[134],"+":[135],"}":[137],"items,":[139],"$O(({1":[141,153],"})\\log":[144,156],"but":[148],"expense":[151],"worst-case":[162],"7":[165],"on":[166]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}