{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:56:54Z","timestamp":1720699014790},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9755,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1016\/0166-218x(86)90036-3","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T16:34:42Z","timestamp":1032280482000},"page":"123-134","source":"Crossref","is-referenced-by-count":15,"title":["A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring"],"prefix":"10.1016","volume":"15","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90036-3_BIB1","series-title":"MSRR No. 518","article-title":"On the maximum-weight clique problem,","author":"Balas","year":"1985"},{"key":"10.1016\/0166-218X(86)90036-3_BIB2","series-title":"MSRR No. 515","article-title":"Finding a maximum clique in an arbitrary graph","author":"Balas","year":"1984"},{"key":"10.1016\/0166-218X(86)90036-3_BIB7","unstructured":"SIAM J. Comput., to appear"},{"key":"10.1016\/0166-218X(86)90036-3_BIB3","series-title":"Technical Report No. 406","article-title":"Maximal chordal subgraphs","author":"Dearing","year":"1983"},{"key":"10.1016\/0166-218X(86)90036-3_BIB4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0166-218X(86)90036-3_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(86)90036-3_BIB6","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T17:22:48Z","timestamp":1554830568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0166218X86900363"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90036-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}