乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T20:40:44Z","timestamp":1718138444786},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2152,"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":[[2007,10]]},"DOI":"10.1016\/j.tcs.2007.04.033","type":"journal-article","created":{"date-parts":[[2007,5,9]],"date-time":"2007-05-09T11:04:39Z","timestamp":1178708679000},"page":"1-10","source":"Crossref","is-referenced-by-count":16,"title":["On the minimum monochromatic or multicolored subgraph partition problems"],"prefix":"10.1016","volume":"385","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"R10","key":"10.1016\/j.tcs.2007.04.033_b1","first-page":"1","article-title":"Multicolored hamilton cycles","volume":"2","author":"Albert","year":"1995","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2007.04.033_b2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(91)90059-S","article-title":"Multicolored forests in bipartite decompositions of graphs","volume":"53","author":"Alon","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2007.04.033_b3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","article-title":"Partitioning into graphs with only small components","volume":"87","author":"Alon","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2007.04.033_b4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","article-title":"Partitions of graphs into one or two independent sets and cliques","volume":"152","author":"Brandstadt","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2007.04.033_b5","first-page":"299","article-title":"Paths and cycles in colored graphs","volume":"31","author":"Broersma","year":"2005","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.tcs.2007.04.033_b6","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jctb.1996.0071","article-title":"Multicolored trees in complete graphs","volume":"68","author":"Brualdi","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2007.04.033_b7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0012-365X(00)00229-6","article-title":"Graph partition problems into cycles and paths","volume":"233","author":"Enomoto","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2007.04.033_b8","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","article-title":"Vertex coverings by monochromatic cycles and trees","volume":"51","author":"Erd\u0151s","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2007.04.033_b9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0167-5060(08)70377-7","article-title":"Rainbow subgraphs in edge-colorings of complete graphs","volume":"55","author":"Erd\u0151s","year":"1993","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.tcs.2007.04.033_b10","series-title":"Proceedings of the 6th Annual European Symposium on Algorithms","first-page":"187","article-title":"Positioning guards at fixed height above a terrain\u2014an optimum inapproximability result","volume":"vol. 1461","author":"Eidenbenz","year":"1998"},{"key":"10.1016\/j.tcs.2007.04.033_b11","doi-asserted-by":"crossref","unstructured":"T. Feder, P. Hell, S. Klein, R. Motwani, Complexity of graph partition problems, in: Proceedings of Thirty-First Annual ACM Symposium on Theory of Computing STOC\u201999, 1999, pp. 464\u2013472","DOI":"10.1145\/301250.301373"},{"key":"10.1016\/j.tcs.2007.04.033_b12","doi-asserted-by":"crossref","unstructured":"U. Feige, A threshold of lnn for approximating set cover, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing STOC\u201996, 1996, pp. 314\u2013318","DOI":"10.1145\/237814.237977"},{"key":"10.1016\/j.tcs.2007.04.033_b13","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.tcs.2007.04.033_b14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03f5","volume":"182","author":"Hastad","year":"1999","journal-title":"Acta Math."},{"key":"10.1016\/j.tcs.2007.04.033_b15","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","article-title":"The NP-completeness of some edge-partition problems","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2007.04.033_b16","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jctb.1996.0065","article-title":"Partitioning by monochromatic trees","volume":"68","author":"Haxell","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.tcs.2007.04.033_b17","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/jctb.1997.1737","article-title":"Partitioning complete bipartite graphs by monochromatic cycles","volume":"69","author":"Haxell","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"10.1016\/j.tcs.2007.04.033_b18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10878-006-8460-7","article-title":"Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees","volume":"11","author":"Jin","year":"2006","journal-title":"J. Comb. Optim."},{"issue":"11","key":"10.1016\/j.tcs.2007.04.033_b19","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1080\/00207160412331290685","article-title":"The complexity for partitioning graphs by monochromatic trees, cycles and paths","volume":"81","author":"Jin","year":"2004","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"10.1016\/j.tcs.2007.04.033_b20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/jgt.20044","article-title":"Partitioning complete multipartite graphs by monochromatic trees","volume":"48","author":"Kaneko","year":"2005","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2007.04.033_b21","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/j.tcs.2007.04.033_b22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(98)00124-3","article-title":"Generalized partitions of graphs","volume":"91","author":"MacGillivray","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2007.04.033_b23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01858468","article-title":"Minimal colorings for properly colored subgraphs","volume":"12","author":"Manoussakis","year":"1996","journal-title":"Graphs Combin."},{"key":"10.1016\/j.tcs.2007.04.033_b24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(00)00231-0","article-title":"Graph colorings and partitions","volume":"263","author":"Yegnanarayanan","year":"2001","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507003726?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507003726?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:02:13Z","timestamp":1556395333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397507003726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["S0304397507003726"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2007.04.033","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}