{"id":"https://openalex.org/W2056010228","doi":"https://doi.org/10.1142/s0129054197000161","title":"The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties","display_name":"The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties","publication_year":1997,"publication_date":"1997-09-01","ids":{"openalex":"https://openalex.org/W2056010228","doi":"https://doi.org/10.1142/s0129054197000161","mag":"2056010228"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054197000161","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054197000161","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5005228383","display_name":"H. K. Dai","orcid":"https://orcid.org/0000-0003-4589-8400"},"institutions":[{"id":"https://openalex.org/I24571045","display_name":"University of North Dakota","ror":"https://ror.org/04a5szx83","country_code":"US","type":"education","lineage":["https://openalex.org/I24571045"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. K. Dai","raw_affiliation_strings":["Department of Computer Science, University of North Dakota, Grand Forks, North Dakota 58202, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Dakota, Grand Forks, North Dakota 58202, U.S.A","institution_ids":["https://openalex.org/I24571045"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005228383"],"corresponding_institution_ids":["https://openalex.org/I24571045"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22867642,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"08","issue":"03","first_page":"237","last_page":"252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9751999974250793,"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.9751999974250793,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.972000002861023,"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/T12288","display_name":"Optimization and Search Problems","score":0.9506999850273132,"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/interconnection","display_name":"Interconnection","score":0.8746984004974365},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.7071883082389832},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6700742244720459},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5340050458908081},{"id":"https://openalex.org/keywords/multistage-interconnection-networks","display_name":"Multistage interconnection networks","score":0.522093653678894},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5218290686607361},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.513964831829071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48109883069992065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47488754987716675},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4518241584300995},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43347975611686707},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4255637526512146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39244529604911804},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.38342034816741943},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36077314615249634},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3457179069519043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23875951766967773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23243364691734314},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1674656867980957}],"concepts":[{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.8746984004974365},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.7071883082389832},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6700742244720459},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5340050458908081},{"id":"https://openalex.org/C2776832011","wikidata":"https://www.wikidata.org/wiki/Q6935099","display_name":"Multistage interconnection networks","level":3,"score":0.522093653678894},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5218290686607361},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.513964831829071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48109883069992065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47488754987716675},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4518241584300995},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43347975611686707},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4255637526512146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39244529604911804},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.38342034816741943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36077314615249634},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3457179069519043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23875951766967773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23243364691734314},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1674656867980957},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054197000161","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054197000161","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W1560227336","https://openalex.org/W1830484068","https://openalex.org/W1978918876","https://openalex.org/W4250172890","https://openalex.org/W2255502885","https://openalex.org/W1059640051","https://openalex.org/W2054821198","https://openalex.org/W2509016790"],"abstract_inverted_index":{"Concentrators":[0],"and":[1,13,57],"generalized-concentrators":[2],"are":[3],"interconnection":[4,17,20,31],"networks":[5],"that":[6],"provide":[7],"respectively":[8],"pairwise":[9],"vertex-disjoint":[10],"directed":[11],"paths":[12],"trees":[14],"to":[15],"satisfy":[16],"requests.":[18],"An":[19],"network":[21],"is":[22],"non-blocking":[23,55],"in":[24],"the":[25,53],"strict":[26],"sense":[27],"if":[28],"every":[29],"compatible":[30],"request":[32],"can":[33],"be":[34],"satisfied":[35],"by":[36,63],"a":[37],"path":[38],"regardless":[39],"of":[40],"any":[41],"existing":[42],"interconnections.":[43],"We":[44],"present":[45],"polynomial":[46],"time":[47],"computational":[48],"complexity":[49],"results":[50],"for":[51],"deciding":[52],"strictly":[54],"concentration":[56],"generalized-concentration":[58],"properties":[59],"with":[60],"small":[61],"depth,":[62],"using":[64],"b-matching":[65],"techniques.":[66]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}