{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:17:30Z","timestamp":1648531050899},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0950-7051(95)01005-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:33:54Z","timestamp":1027622034000},"page":"3-13","source":"Crossref","is-referenced-by-count":2,"title":["Parallel search-and-learn techniques and graph coloring"],"prefix":"10.1016","volume":"9","author":[{"given":"C.P.","family":"Ravikumar","sequence":"first","affiliation":[]},{"given":"R.","family":"Aggarwal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0950-7051(95)01005-X_BIB1","series-title":"Discrete Optimization Algorithms and Pascal Programs","author":"Deo","year":"1983"},{"key":"10.1016\/0950-7051(95)01005-X_BIB2","first-page":"390","article-title":"Automated synthesis of datapaths in digital systems","volume":"5","author":"Tseng","year":"1986","journal-title":"IEEE Transactions CAD"},{"key":"10.1016\/0950-7051(95)01005-X_BIB3","series-title":"Proc. Int. Test Conf.","first-page":"463","article-title":"Allocation and assignment in high-level synthesis for sell'testable data paths","author":"Avra","year":"1991"},{"key":"10.1016\/0950-7051(95)01005-X_BIB4","series-title":"Proc. . Int. Test Coml.","first-page":"565","article-title":"Diagnosis for wiring interconnects","author":"Cheng","year":"1990"},{"key":"10.1016\/0950-7051(95)01005-X_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0010-4485(92)90008-X","article-title":"Interval partition with hounded overlap","author":"Ravikumar","year":"1992","journal-title":"Computer-.Aided Design"},{"key":"10.1016\/0950-7051(95)01005-X_BIB6","series-title":"Algorithmic Graph Theory r and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0950-7051(95)01005-X_BIB7","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","article-title":"Chromatic scheduling and chromatic number problem","volume":"19","author":"Brown","year":"1972","journal-title":"Management Science"},{"key":"10.1016\/0950-7051(95)01005-X_BIB8","series-title":"Ausgewahlte Operations Research Software in FORTRAN","first-page":"103","article-title":"Maximales matching in graphen","author":"Pape","year":"1980"},{"key":"10.1016\/0950-7051(95)01005-X_BIB9","article-title":"PVM 3.0parallel virtual machine 3.0","author":"Beguelin","year":"1992"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:095070519501005X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:095070519501005X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T23:20:11Z","timestamp":1555629611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/095070519501005X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["095070519501005X"],"URL":"https:\/\/doi.org\/10.1016\/0950-7051(95)01005-x","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}