{"id":"https://openalex.org/W2134861622","doi":"https://doi.org/10.1142/s0218126692000106","title":"A PARALLEL ALGORITHM FOR SINGLE ROW ROUTING PROBLEMS","display_name":"A PARALLEL ALGORITHM FOR SINGLE ROW ROUTING PROBLEMS","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2134861622","doi":"https://doi.org/10.1142/s0218126692000106","mag":"2134861622"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126692000106","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126692000106","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","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/A5025693896","display_name":"A. Roy","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ARNOB ROY","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071975084","display_name":"Jitender S. Deogun","orcid":"https://orcid.org/0000-0001-6402-2549"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JITENDER DEOGUN","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109572096","display_name":"Naveed A. Sherwani","orcid":null},"institutions":[{"id":"https://openalex.org/I141649380","display_name":"Western Michigan University","ror":"https://ror.org/04j198w64","country_code":"US","type":"education","lineage":["https://openalex.org/I141649380"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"NAVEED A. SHERWANI","raw_affiliation_strings":["Department of Computer Science, Western Michigan University, Kalamazoo, MI 49008, USA","Department of Computer Science, Western Michigan University, Kalamazoo, MI 49008, USA.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Western Michigan University, Kalamazoo, MI 49008, USA","institution_ids":["https://openalex.org/I141649380"]},{"raw_affiliation_string":"Department of Computer Science, Western Michigan University, Kalamazoo, MI 49008, USA.#TAB#","institution_ids":["https://openalex.org/I141649380"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025693896"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.0418,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77281796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"02","issue":"02","first_page":"113","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6616387367248535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6028587222099304},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5847072601318359},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5210891962051392},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5102927684783936},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5036081671714783},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.49994587898254395},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4234524369239807},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.42076462507247925},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37901270389556885},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.09825646877288818}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6616387367248535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6028587222099304},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5847072601318359},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5210891962051392},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5102927684783936},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5036081671714783},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.49994587898254395},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4234524369239807},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.42076462507247925},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37901270389556885},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.09825646877288818},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126692000106","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126692000106","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2137551906","https://openalex.org/W2375399753","https://openalex.org/W2520339110","https://openalex.org/W2558246529","https://openalex.org/W1994373270","https://openalex.org/W2438511141","https://openalex.org/W2204238626","https://openalex.org/W2041855631","https://openalex.org/W2183218633","https://openalex.org/W1536885268"],"abstract_inverted_index":{"Single":[0],"Row":[1],"Routing":[2],"problem":[3,39],"is":[4,72,97,118,159],"one":[5],"of":[6,14,28,68,85,126,141,170],"the":[7,11,61,83,101,112,123,127,163,168,171,181],"important":[8],"subproblems":[9],"in":[10,137],"layout":[12],"design":[13],"multilayer":[15],"printed":[16],"circuit":[17],"boards.":[18],"This":[19,135],"routing":[20,27,33,38,64],"technique":[21],"has":[22,40],"also":[23],"been":[24,41,49],"applied":[25],"to":[26,162,175],"microwave":[29],"citcuits":[30],"and":[31,44,89],"other":[32],"problems.":[34],"The":[35,66,94,146],"single":[36,62],"row":[37,63],"extensively":[42],"studied":[43],"several":[45],"sequential":[46,79,95,106,128,178],"algorithms":[47],"have":[48],"proposed.":[50],"In":[51],"this":[52,69],"paper,":[53],"we":[54],"present":[55],"a":[56,73,90,138,154],"parallel":[57,70,109,139],"hypercube":[58,113],"algorithm":[59,71,80,96,110,129,140,152,182],"for":[60,111],"problem.":[65],"basis":[67],"new":[74],"O(n":[75],"2":[76],"log":[77],"n)":[78],"based":[81,98],"on":[82,99],"concept":[84],"modified":[86],"cut":[87],"numbers":[88],"graph":[91],"decomposition":[92],"scheme.":[93,134],"generalizing":[100],"concepts":[102],"underlying":[103],"two":[104],"existing":[105,177,189],"algorithms.":[107],"A":[108],"architecture":[114],"with":[115,130],"N":[116],"processors":[117],"then":[119],"developed":[120],"by":[121],"combining":[122],"nice":[124],"features":[125],"an":[131],"efficient":[132],"allocation":[133],"results":[136,148,186],"[Formula:":[142],"see":[143],"text]":[144],"complexity.":[145],"experimental":[147],"show":[149],"that":[150,158],"our":[151],"achieves":[153],"speed":[155],"up":[156],"factor":[157],"quite":[160],"close":[161],"theoretical":[164],"bound":[165],"while":[166],"maintaining":[167],"quality":[169],"solutions,":[172],"as":[173],"compared":[174],"any":[176,188],"algorithm.":[179],"Moreover,":[180],"produces":[183],"28%":[184],"better":[185],"than":[187],"results.":[190]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}