{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:17Z","timestamp":1720640837305},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80146-5","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"138-141","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Linear time recognition of Weak bisplit graphs"],"prefix":"10.1016","volume":"5","author":[{"given":"Vassilis","family":"Giakoumakis","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Vanherpe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No 4","key":"10.1016\/S1571-0653(05)80146-5_BIB1","first-page":"926","article-title":"A linear recognition algorithm for cographs, Siam","volume":"Vol 14","author":"Corneil","year":"1985","journal-title":"Journal of Computing"},{"key":"10.1016\/S1571-0653(05)80146-5_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraph grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S1571-0653(05)80146-5_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/10692760_1","article-title":"Linear time solvable Optimization Problems on Graphs of Bounded Clique","volume":"1517","author":"Courcelle","year":"1998","journal-title":"Width Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0653(05)80146-5_BIB4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1142\/S0129054199000368","article-title":"Bipartite graphs totally decomposable by canonical decomposition","volume":"10","author":"Fouquet","year":"1997","journal-title":"International Journal on Fundations of Computer Science"},{"key":"10.1016\/S1571-0653(05)80146-5_BIB5","series-title":"Computers and Intractability A Guide to the Theory of NP Completeness Mathematical series","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0653(05)80146-5_BIB6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1006\/aama.1996.0519","article-title":"Bicomplement reducible graphs","volume":"18","author":"Giakoumakis","year":"1997","journal-title":"Advances in Appl. Math."},{"key":"10.1016\/S1571-0653(05)80146-5_BIB7","article-title":"Linear time recognition of weak-bisplit graphs Technical report #99-17","author":"Giakoumakis","year":"1999","journal-title":"LaRIA, Universit\u00e9 de Picardie Jules Verne"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801465?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801465?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:58:04Z","timestamp":1548514684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":7,"alternative-id":["S1571065305801465"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80146-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}