{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:19Z","timestamp":1757626219950,"version":"3.44.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0167-9260(91)90025-g","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"267-292","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["New methods for coloring and clique partitioning in data path allocation"],"prefix":"10.1016","volume":"12","author":[{"given":"David","family":"Springer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.E.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1991","series-title":"A survey of High-Level Synthesis Systems","author":"Walker","key":"10.1016\/0167-9260(91)90025-G_BIB1"},{"year":"1990","series-title":"Algorithmic and Register Transfer Level Synthesis: The System Architect's Workbench","author":"Thomas","key":"10.1016\/0167-9260(91)90025-G_BIB2"},{"key":"10.1016\/0167-9260(91)90025-G_BIB3","series-title":"PhD thesis","article-title":"High-level synthesis of digital circuits using glogal scheduling and binding algorithms","author":"Paulin","year":"1988"},{"key":"10.1016\/0167-9260(91)90025-G_BIB4","series-title":"Proc. 27th DAC, ACM\/IEEE","first-page":"489","article-title":"Synthesis using path-based scheduling","author":"Camposano","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB5","series-title":"Proc. 27th DAC","first-page":"65","article-title":"Optimum and heuristic data path scheduling under resource constraints","author":"Hwang","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB6","series-title":"Proc. ICCAD-90, ACM, IEEE","first-page":"262","article-title":"Salsa: A new approach to scheduling with timing constraints","author":"Nestor","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB7","series-title":"Proc. 27th DAC, ACM\/IEE","first-page":"71","article-title":"The combination of scheduling, allocation, and mapping in a single algorithm","author":"Cloutier","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB8","series-title":"Proc. EDAC'90","first-page":"78","article-title":"Schalloc: An algorithm for simultaneous scheduling and connectivity binding in a datapath synthesis system","author":"Berry","year":"1990"},{"issue":"8","key":"10.1016\/0167-9260(91)90025-G_BIB9","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/43.31534","article-title":"Algorithms for hardware allocation in data path synthesis","volume":"8","author":"Devadas","year":"1989","journal-title":"IEEE Trans. CAD"},{"key":"10.1016\/0167-9260(91)90025-G_BIB10","series-title":"Proc. ICCAD-90, ACM, IEEEE","first-page":"258","article-title":"A global optimization approach for architectural synthesis","author":"Gebotys","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB11","series-title":"PhD thesis","article-title":"The VLSI design automation assistant: a knowledge-based expert system","author":"Kowalski","year":"1984"},{"key":"10.1016\/0167-9260(91)90025-G_BIB12","series-title":"Proc. 25th DAC","first-page":"536","article-title":"Splicer: A heuristic approach to connectivity binding","author":"Prangrle","year":"1988"},{"key":"10.1016\/0167-9260(91)90025-G_BIB13","series-title":"Master's thesis","article-title":"Automated synthesis of data paths","author":"Hitchcock","year":"1983"},{"key":"10.1016\/0167-9260(91)90025-G_BIB14","series-title":"PhD thesis","article-title":"Automated synthesis of data paths in digital systems","author":"Tseng","year":"1984"},{"key":"10.1016\/0167-9260(91)90025-G_BIB15","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/43.31522","article-title":"Force-directed scheduling for the behavioral synthesis of asic's","volume":"8","author":"Paulin","year":"1989","journal-title":"IEEE Trans. CAD"},{"key":"10.1016\/0167-9260(91)90025-G_BIB16","series-title":"Proc. 25th DAC, ACM\/IEEE","first-page":"489","article-title":"Design process model in the yorktown silicon compiler","author":"Composano","year":"1988"},{"key":"10.1016\/0167-9260(91)90025-G_BIB17","series-title":"PhD thesis","article-title":"Automatic synthesis of microprocessors","author":"Rajan","year":"1988"},{"key":"10.1016\/0167-9260(91)90025-G_BIB18","series-title":"Proc. 24th DAC, ACM\/IEEE","first-page":"210","article-title":"Real: A program for register allocation","author":"Kurdahi","year":"1987"},{"key":"10.1016\/0167-9260(91)90025-G_BIB19","series-title":"Proc. ICCAD-88, IEEE","first-page":"44","article-title":"Automatic synthesis of a multi-bus architecture for dsp","author":"Haroun","year":"1988"},{"key":"10.1016\/0167-9260(91)90025-G_BIB20","series-title":"Proc. ICCAD-90, AMC, IEEE","first-page":"254","article-title":"Exploiting the special structure of conflict and compatibility graphs in high-level synthesis","author":"Springer","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB21","series-title":"Proc. 27th DAC","first-page":"499","article-title":"Data path allocation based on bipartite weighted matching","author":"Huang","year":"1990"},{"key":"10.1016\/0167-9260(91)90025-G_BIB22","series-title":"Linear Progaramming","article-title":"Linear Programming","author":"Chvatal","year":"1983"},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/0167-9260(91)90025-G_BIB23"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609190025G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609190025G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:22Z","timestamp":1757453842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792609190025G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["016792609190025G"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(91)90025-g","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1991,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New methods for coloring and clique partitioning in data path allocation","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(91)90025-G","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}