{"id":"https://openalex.org/W2005630429","doi":"https://doi.org/10.1142/s1793830909000117","title":"ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE K\u00d6NIG\u2013EGEVAR\u00dd THEOREM","display_name":"ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE K\u00d6NIG\u2013EGEVAR\u00dd THEOREM","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2005630429","doi":"https://doi.org/10.1142/s1793830909000117","mag":"2005630429"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830909000117","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000117","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, 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/A5103100108","display_name":"Hung Q. Ngo","orcid":"https://orcid.org/0000-0002-5483-7581"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HUNG Q. NGO","raw_affiliation_strings":["Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Amherst, New York, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Amherst, New York, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077304276","display_name":"Thanh\u2010Nhan Nguyen","orcid":"https://orcid.org/0000-0001-7137-4892"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"THANH-NHAN NGUYEN","raw_affiliation_strings":["Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Amherst, New York, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Amherst, New York, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041525219","display_name":"Duc T. Ha","orcid":"https://orcid.org/0000-0001-5083-938X"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DUC T. HA","raw_affiliation_strings":["Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Amherst, New York, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Amherst, New York, USA","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103100108"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11362862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"01","issue":"01","first_page":"127","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994999766349792,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9926000237464905,"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/multicast","display_name":"Multicast","score":0.8192082047462463},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6712291836738586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6378846168518066},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.6098468899726868},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5396928787231445},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5386552214622498},{"id":"https://openalex.org/keywords/banyan","display_name":"Banyan","score":0.523786187171936},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.4752480983734131},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.46450042724609375},{"id":"https://openalex.org/keywords/crosstalk","display_name":"Crosstalk","score":0.4223010540008545},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33489909768104553},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2986040413379669},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.29298827052116394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2676987648010254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23172014951705933},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10210558772087097}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8192082047462463},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6712291836738586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6378846168518066},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.6098468899726868},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5396928787231445},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5386552214622498},{"id":"https://openalex.org/C2780435913","wikidata":"https://www.wikidata.org/wiki/Q465570","display_name":"Banyan","level":2,"score":0.523786187171936},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.4752480983734131},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.46450042724609375},{"id":"https://openalex.org/C169822122","wikidata":"https://www.wikidata.org/wiki/Q230187","display_name":"Crosstalk","level":2,"score":0.4223010540008545},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33489909768104553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2986040413379669},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29298827052116394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2676987648010254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23172014951705933},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10210558772087097},{"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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s1793830909000117","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000117","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.3861","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.3861","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.buffalo.edu/~hungngo/papers/ngo-nguyen-ha-dmaa.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W27073611","https://openalex.org/W234486843","https://openalex.org/W1572000546","https://openalex.org/W1588462524","https://openalex.org/W1598492279","https://openalex.org/W1971923044","https://openalex.org/W1976488293","https://openalex.org/W1984010891","https://openalex.org/W1984110971","https://openalex.org/W1992204509","https://openalex.org/W2059467407","https://openalex.org/W2066931744","https://openalex.org/W2094897025","https://openalex.org/W2095901773","https://openalex.org/W2100839605","https://openalex.org/W2103214067","https://openalex.org/W2107659149","https://openalex.org/W2108068549","https://openalex.org/W2111550494","https://openalex.org/W2111761066","https://openalex.org/W2116454746","https://openalex.org/W2125128741","https://openalex.org/W2130087724","https://openalex.org/W2134048090","https://openalex.org/W2144311059","https://openalex.org/W2155809496","https://openalex.org/W2159151445","https://openalex.org/W4241764762"],"related_works":["https://openalex.org/W2141226803","https://openalex.org/W1972955796","https://openalex.org/W1541857863","https://openalex.org/W2219910205","https://openalex.org/W2978800595","https://openalex.org/W1966768284","https://openalex.org/W207048982","https://openalex.org/W2026651734","https://openalex.org/W2385427787","https://openalex.org/W2070403242"],"abstract_inverted_index":{"When":[0],"analyzing":[1,185],"a":[2,12,15,37,43,91,115,130,161,253,267],"nonblocking":[3,190,215],"switching":[4,64,259],"network,":[5,45],"the":[6,19,51,87,98,108,127,144,152,168,175,182,196,200,206,217,239,244,249,262,272,276,292,297],"typical":[7],"problem":[8],"is":[9,90,104,147,252,278],"to":[10,53,105,126,177,210,281],"find":[11],"route":[13],"for":[14,46,50,174,195,205,220,237,256,291],"new":[16],"request":[17],"through":[18],"network":[20,52,176,209,251,277],"without":[21],"disturbing":[22],"existing":[23],"routes.":[24],"By":[25],"solving":[26],"this":[27,82],"problem,":[28],"we":[29,84,165,202,285],"can":[30,166],"derive":[31,167,203],"how":[32],"many":[33],"hardware":[34,172],"components":[35,173],"of":[36,63,114,121,129,139,155,171,271,304],"certain":[38],"type":[39],"(Banyan":[40],"planes":[41],"in":[42,59,133,199],"multi-log":[44,192,208,250,293],"instance)":[47],"are":[48,301],"needed":[49],"be":[54,178,211,282],"nonblocking.":[55,179],"This":[56],"scenario":[57],"appears":[58],"virtually":[60],"all":[61],"combinations":[62],"environments:":[65],"strictly,":[66],"widesense":[67,189,214],"or":[68,72,78],"rearrangeably":[69],"nonblocking,":[70],"unicast":[71],"multicast":[73,191,213,258,294],"switching,":[74],"and":[75,187,231],"circuit,":[76],"multirate,":[77],"photonic":[79],"switching.":[80],"In":[81],"paper,":[83],"show":[85,286],"that":[86,134,248,287],"K\u00f6nig\u2013Egevar\u00fd":[88,145],"theorem":[89],"very":[92],"good":[93,254],"tool":[94],"which":[95],"helps":[96],"solve":[97],"above":[99],"prototypical":[100],"problem.":[101],"The":[102,118,137],"idea":[103],"somehow":[106],"\"represent\"":[107],"potential":[109],"blocking":[110,122,156],"connections":[111,123],"as":[112],"edges":[113],"bipartite":[116,135],"graph.":[117,136],"maximum":[119,131,153],"number":[120,154,170],"roughly":[124],"corresponds":[125],"size":[128,138,242],"matching":[132],"any":[140,221],"vertex":[141,163],"cover,":[142,164],"by":[143,159,184],"theorem,":[146],"an":[148],"upper":[149],"bound":[150],"on":[151],"connections.":[157],"Thus,":[158],"specifying":[160],"small":[162],"sufficient":[169],"We":[180],"illustrate":[181],"technique":[183],"crosstalk-free":[186,212,257],"non-crosstalk-free":[188],"networks.":[193],"Particularly,":[194],"first":[197],"time":[198],"literature":[201],"conditions":[204],"d-ary":[207],"under":[216,296],"window":[218,223,241],"algorithm":[219],"given":[222],"size.":[224],"Several":[225],"by-products":[226],"follow":[227],"from":[228],"our":[229,234,305],"approach":[230,264],"results.":[232,306],"Firstly,":[233],"results":[235,290],"allow":[236],"computing":[238],"best":[240],"minimizing":[243],"fabric":[245],"cost,":[246],"showing":[247],"candidate":[255],"architectures.":[260],"Secondly,":[261],"analytical":[263],"also":[265],"gives":[266],"much":[268],"simpler":[269],"proof":[270],"known":[273,289],"case":[274],"when":[275],"not":[279],"required":[280],"crosstalk-free.":[283],"Thirdly,":[284],"several":[288],"networks":[295],"so-called":[298],"fanout":[299],"constraints":[300],"simple":[302],"corollaries":[303]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}