乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T11:09:01Z","timestamp":1693048141048},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00487-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"161-167","source":"Crossref","is-referenced-by-count":12,"title":["Structure and stability number of chair-, co-P- and gem-free graphs revisited"],"prefix":"10.1016","volume":"86","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Ho\u00e0ng-Oanh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Jean-Marie","family":"Vanherpe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00487-8_BIB001","unstructured":"A. Brandst\u00e4dt, (P5, diamond)-free graphs revisited: Structure and linear time optimization, Manuscript 2000, to appear in Discrete Appl. Math"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB002","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Manuscript 2001, to appear in Conference Proceedings of WG'2002","DOI":"10.1007\/3-540-36379-3_6"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB003","unstructured":"A. Brandst\u00e4dt, C.T. Ho\u00e0ng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Manuscript 2001, to appear in Discrete Appl. Math"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB004","series-title":"Graph Classes: A Survey","volume":"3","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB005","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(02)00291-0","article-title":"Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time","volume":"84","author":"Brandst\u00e4dt","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB006","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB007","first-page":"249","article-title":"Cographs: recognition, applications, and algorithms","volume":"43","author":"Corneil","year":"1984","journal-title":"Congressus Numer."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB008","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB009","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. Syst. Sci."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB010","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB011","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","article-title":"Upper bounds to the clique width of graphs","volume":"101","author":"Courcelle","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB012","series-title":"Trees in Algebra and Programming\u2014CAAP'94","first-page":"68","article-title":"A new linear algorithm for modular decomposition, LIRMM, University Montpellier (1995); Preliminary version","volume":"787","author":"Cournier","year":"1994"},{"issue":"2","key":"10.1016\/S0020-0190(02)00487-8_BIB013","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1006\/jagm.2001.1185","article-title":"Efficient and practical modular decomposition","volume":"41","author":"Dahlhaus","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB014","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(96)00220-4","article-title":"On extended P4-reducible and extended P4-sparse graphs","volume":"180","author":"Giakoumakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB015","unstructured":"C.T. Ho\u00e0ng, A class of perfect graphs, Ms.Sc. Thesis, School of Computer Science, McGill University, Montreal, 1983"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB016","unstructured":"C.T. Ho\u00e0ng, Perfect Graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB017","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190130407","article-title":"Some classes of perfectly orderable graphs","volume":"13","author":"Ho\u00e0ng","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(02)00487-8_BIB018","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0012-365X(99)00408-2","article-title":"Conic reduction of graphs for the stable set problem","volume":"222","author":"Lozin","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB019","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","article-title":"Modular decomposition and transitive orientation","volume":"201","author":"McConnell","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB020","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0020-0190(02)00487-8_BIB021","author":"Zverovich"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004878?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004878?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:24:32Z","timestamp":1584509072000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002004878"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00487-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}