{"id":"https://openalex.org/W2094911455","doi":"https://doi.org/10.1002/net.3230130305","title":"Circuit partitioning with size and connection constraints","display_name":"Circuit partitioning with size and connection constraints","publication_year":1983,"publication_date":"1983-09-01","ids":{"openalex":"https://openalex.org/W2094911455","doi":"https://doi.org/10.1002/net.3230130305","mag":"2094911455"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130305","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/A5077648725","display_name":"Yehoshua Perl","orcid":"https://orcid.org/0000-0003-1940-9386"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"Yehoshua Perl","raw_affiliation_strings":["Bar-Ilan University, Ramat-Gan, Israel","Department of Computer Science, Rutgers University, New Brunswick, New Jersey 08903","Bar\u2010Ilan University, Ramat\u2010Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Department of Computer Science, Rutgers University, New Brunswick, New Jersey 08903","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Bar\u2010Ilan University, Ramat\u2010Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041731995","display_name":"Marc Snir","orcid":"https://orcid.org/0000-0002-3504-2468"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Marc Snir","raw_affiliation_strings":["Department of Computer Science, Hebrew University, Jerusalem, Israel","[Department of Computer Science, Hebrew University, Jerusalem, Israel]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"[Department of Computer Science, Hebrew University, Jerusalem, Israel]","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077648725"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I13955877"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1242,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.78817266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"13","issue":"3","first_page":"365","last_page":"375"},"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.9973000288009644,"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.9973000288009644,"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/T11567","display_name":"semigroups and automata theory","score":0.9947999715805054,"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/T10142","display_name":"Formal Methods in Verification","score":0.9944999814033508,"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/connection","display_name":"Connection (principal bundle)","score":0.733422040939331},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5562974214553833},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4840656816959381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4601060152053833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4412965178489685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.429293155670166},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42684251070022583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42519986629486084},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4206172525882721},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4108765721321106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.408471941947937},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36171412467956543}],"concepts":[{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.733422040939331},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5562974214553833},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4840656816959381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4601060152053833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4412965178489685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.429293155670166},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42684251070022583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42519986629486084},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4206172525882721},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4108765721321106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.408471941947937},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36171412467956543},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130305","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2014265988","https://openalex.org/W2048383295","https://openalex.org/W2053400346","https://openalex.org/W2157952725"],"related_works":["https://openalex.org/W587735977","https://openalex.org/W1978142926","https://openalex.org/W3157395178","https://openalex.org/W184455116","https://openalex.org/W2028768252","https://openalex.org/W2371558776","https://openalex.org/W2045569473","https://openalex.org/W2364426643","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"problem":[2,27],"of":[3,14,20],"partitioning":[4],"a":[5,38,52],"circuit":[6,50],"into":[7],"subcomponents":[8],"with":[9],"constraints":[10],"on":[11],"the":[12,18,46,49],"size":[13],"each":[15],"subcomponent":[16],"and":[17],"number":[19],"external":[21],"connections":[22],"is":[23,28,43],"examined.":[24],"While":[25],"this":[26],"shown":[29],"to":[30],"be":[31],"NP\u2010complete":[32],"even":[33],"for":[34,45],"very":[35],"restricted":[36],"cases,":[37],"pseudo\u2010polynomial":[39],"dynamic":[40],"programming":[41],"algorithm":[42],"given":[44],"case":[47],"where":[48],"has":[51],"tree":[53],"structure.":[54]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}