乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:55:53Z","timestamp":1648616153926},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation of Singapore","doi-asserted-by":"crossref","award":["NRF-CRP2-2007-03"],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University","doi-asserted-by":"crossref","award":["M58110040"],"id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["10701060","10831002"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1016\/j.dam.2011.08.024","type":"journal-article","created":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T14:47:57Z","timestamp":1318862877000},"page":"100-107","source":"Crossref","is-referenced-by-count":3,"title":["Arboricity: An acyclic hypergraph decomposition problem motivated by database theory"],"prefix":"10.1016","volume":"160","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[]},{"given":"Lijun","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Anthony K.H.","family":"Tung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2011.08.024_br000005","series-title":"STOC 1981\u2013Proceedings of the 13th Annual ACM Symposium on Theory of Computing","first-page":"355","article-title":"Properties of acyclic database schemes","author":"Beeri","year":"1981"},{"issue":"3","key":"10.1016\/j.dam.2011.08.024_br000010","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.dam.2011.08.024_br000015","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"issue":"2","key":"10.1016\/j.dam.2011.08.024_br000020","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/100806035","article-title":"The \u03b1-arboricity of complete uniform hypergraphs","volume":"25","author":"Bermond","year":"2011","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2011.08.024_br000025","series-title":"The CRC Handbook of Combinatorial Designs","first-page":"102","article-title":"Steiner systems","author":"Colbourn","year":"2007"},{"key":"10.1016\/j.dam.2011.08.024_br000030","series-title":"Triple Systems, Oxford Mathematical Monographs","author":"Colbourn","year":"1999"},{"issue":"3","key":"10.1016\/j.dam.2011.08.024_br000035","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/j.dam.2011.08.024_br000040","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/319732.319735","article-title":"A simplified universal relation assumption and its properties","volume":"7","author":"Fagin","year":"1982","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.dam.2011.08.024_br000045","unstructured":"N. Goodman, O. Shmueli, Characterizations of tree database schemas, Tech. rep., Harvard University, Cambridge, Massachusetts, 1981."},{"key":"10.1016\/j.dam.2011.08.024_br000050","unstructured":"M.H. Graham, On the universal relation, Tech. rep., University of Toronto, Toronto, Ontario, Canada, September 1979."},{"issue":"221","key":"10.1016\/j.dam.2011.08.024_br000055","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1090\/S0025-5718-98-00924-7","article-title":"Steiner systems S(5,6,v) with v=72 and 84","volume":"67","author":"Grannell","year":"1998","journal-title":"Math. Comp."},{"key":"10.1016\/j.dam.2011.08.024_br000060","doi-asserted-by":"crossref","first-page":"145","DOI":"10.4153\/CJM-1960-013-3","article-title":"On quadruple systems","volume":"12","author":"Hanani","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.dam.2011.08.024_br000065","unstructured":"H. Li, On acyclic and cyclic hypergraphs, Ph.D. Thesis, Institute of Applied Mathematics, Chinese Academy of Science, Beijing, China, 1999."},{"key":"10.1016\/j.dam.2011.08.024_br000070","first-page":"563","article-title":"On the covering of triples by quadruples","volume":"10","author":"Mills","year":"1974","journal-title":"Graph Theory, and Computing"},{"key":"10.1016\/j.dam.2011.08.024_br000075","series-title":"Contemporary Design Theory","first-page":"371","article-title":"Coverings and packings","author":"Mills","year":"1992"},{"key":"10.1016\/j.dam.2011.08.024_br000080","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(00)00066-2","article-title":"On the spanning tree packing number of a graph a survey","volume":"230","author":"Palmer","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2011.08.024_br000085","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","article-title":"On a packing and covering problem","volume":"5","author":"R\u00f6dl","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2011.08.024_br000090","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.dam.2011.08.024_br000095","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/1098-2418(200008)17:1<29::AID-RSA4>3.0.CO;2-W","article-title":"New bounds on nearly perfect matchings in hypergraphs: higher codegrees do help","volume":"17","author":"Vu","year":"2000","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.dam.2011.08.024_br000100","series-title":"The Information Hypergraph Theory","author":"Wang","year":"2008"},{"issue":"2","key":"10.1016\/j.dam.2011.08.024_br000105","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s102550200020","article-title":"Enumeration of maximum acyclic hypergraphs","volume":"18","author":"Wang","year":"2002","journal-title":"Acta Math. Appl. Sin."},{"key":"10.1016\/j.dam.2011.08.024_br000110","series-title":"VLDB 1981\u2013Proceedings of the 7th International Conference on Very Large Data Bases","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X11003349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X11003349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T07:22:03Z","timestamp":1543476123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X11003349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["S0166218X11003349"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2011.08.024","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}