{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T09:09:51Z","timestamp":1719133791889},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,9]],"date-time":"2007-03-09T00:00:00Z","timestamp":1173398400000},"content-version":"vor","delay-in-days":8590,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The problem of partitioning a circuit into subcomponents with constraints on the size of each subcomponent and the number of external connections is examined. While this problem is shown to be NP\u2010complete even for very restricted cases, a pseudo\u2010polynomial dynamic programming algorithm is given for the case where the circuit has a tree structure.<\/jats:p>","DOI":"10.1002\/net.3230130305","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T16:51:17Z","timestamp":1178902277000},"page":"365-375","source":"Crossref","is-referenced-by-count":15,"title":["Circuit partitioning with size and connection constraints"],"prefix":"10.1002","volume":"13","author":[{"given":"Yehoshua","family":"Perl","sequence":"first","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,9]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"E.Agasi R. I.Becker andY.Perl A shifting algorithm for min\u2010max constrained partition on trees. Proceedings Princeton Conference on Information Sciences and Systems (1982)."},{"key":"e_1_2_1_3_2","volume-title":"The Art and Theory of Dynamic Programming","author":"Dreyfus S. E.","year":"1977"},{"key":"e_1_2_1_4_2","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_5_2","unstructured":"L.HyafilandR. L.Rivest Graph partitioning and constructing optimal decision trees are polynomial complete problems. Report 33 IRIA\u2010Laboria Rocquencourt (1973)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.1.1"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206012"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.183.0217"},{"key":"e_1_2_1_9_2","unstructured":"M.Snir Depth complexity of formulas Ph. D. Thesis Hebrew University (1979)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:54:32Z","timestamp":1697756072000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["10.1002\/net.3230130305"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130305","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}