{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T22:31:04Z","timestamp":1670279464537},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0167-8191(90)90122-p","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"95-100","source":"Crossref","is-referenced-by-count":5,"title":["A parallel variant of a heuristical algorithm for graph colouring"],"prefix":"10.1016","volume":"13","author":[{"given":"Janez","family":"Z\u0306erovnik","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90122-P_BIB1","first-page":"167","article-title":"Finite particle systems and infection models","volume":"94","author":"Donnely","year":"1983"},{"key":"10.1016\/0167-8191(90)90122-P_BIB2","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(90)90122-P_BIB3","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90122-P_BIB4","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirckpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0167-8191(90)90122-P_BIB5","series-title":"Graph Algorithms and NP-Completeness","author":"Melhorn","year":"1984"},{"key":"10.1016\/0167-8191(90)90122-P_BIB6","series-title":"A randomised attack on an NP-complete problem","author":"Welsh","year":"1984"},{"key":"10.1016\/0167-8191(90)90122-P_BIB7","series-title":"Proc. 11th Symposium on Informatics","first-page":"294.1","article-title":"Poskusi s sluc\u0306ajnim hevristi\u010dnim algoritmom","author":"Z\u0306erovnik","year":"1987"},{"key":"10.1016\/0167-8191(90)90122-P_BIB8","series-title":"Graph Theory, Proc. 8th Yugoslav Seminar on Graph Theory","first-page":"137","article-title":"Randomised heuristical algorithm for graph colouring","author":"Z\u0306erovnik","year":"1989"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090122P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090122P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:24Z","timestamp":1551086724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090122P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["016781919090122P"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90122-p","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}