乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T04:42:31Z","timestamp":1711600951844},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00220-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"269-286","source":"Crossref","is-referenced-by-count":30,"title":["On extended P4-reducible and extended P4-sparse graphs"],"prefix":"10.1016","volume":"180","author":[{"given":"Vassilis","family":"Giakoumakis","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Vanherpe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00220-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB2","first-page":"114","article-title":"F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind","author":"Berge","year":"1961"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1979"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB5","series-title":"Linear-time modular decomposition and efficient transitive orientation of undirected graphs","author":"McConnel","year":"1993"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB6","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\/S0304-3975(96)00220-4_BIB7","first-page":"68","article-title":"A new linear algorithm for modular decomposition","volume":"Vol. 787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(93)90539-6","article-title":"A decomposition for a class of (P5,P5)-free graphs","author":"Fouquet","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitive orientierbare graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB10","series-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB11","series-title":"On extended P4-sparse graphs, extended abstract for the 4th Twente Workshop on Graphs and Combinatorial Optimization","author":"Giakoumakis","year":"1995"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB13","series-title":"Topics on perfect graphs","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"88","author":"Gr\u00f6tschel","year":"1984"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB15","author":"Hoang","year":"1985","journal-title":"Doctoral Dissertation"},{"key":"10.1016\/S0304-3975(96)00220-4_BIB16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","article-title":"P4-reducible graphs, a class of tree representable graphs","volume":"81","author":"Jamison","year":"1989","journal-title":"Studies Appl. Math."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A unique tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","article-title":"A linear-time recognition algorithm for P4-sparse graphs","volume":"21","author":"Jamison","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(95)00016-P","article-title":"A linear-time algorithm to recognize P4-reducible graphs","volume":"145","author":"Jamison","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","article-title":"Linear time optimization algorithms for P4-sparse graphs","volume":"61","author":"Jamison","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(96)00220-4_BIB21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","article-title":"P4-trees and substitution decomposition","volume":"39","author":"Spinrad","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002204?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002204?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:25:34Z","timestamp":1556508334000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596002204"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00220-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}