乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T09:03:56Z","timestamp":1712307836529},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"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":1908,"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":[[2008,6]]},"DOI":"10.1016\/j.tcs.2008.02.037","type":"journal-article","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T12:23:34Z","timestamp":1207225414000},"page":"191-205","source":"Crossref","is-referenced-by-count":27,"title":["Cleaning a network with brushes"],"prefix":"10.1016","volume":"399","author":[{"given":"M.E.","family":"Messinger","sequence":"first","affiliation":[]},{"given":"R.J.","family":"Nowakowski","sequence":"additional","affiliation":[]},{"given":"P.","family":"Pra\u0142at","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2008.02.037_b1","series-title":"International Conference in Combinatorics","first-page":"5","article-title":"Searching and sweeping graphs: A brief survey","volume":"vol. LIX","author":"Alspach","year":"2004"},{"key":"10.1016\/j.tcs.2008.02.037_b2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0195-6698(13)80111-4","article-title":"Chip firing games on graphs","volume":"12","author":"Bj\u00f6rner","year":"1991","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/j.tcs.2008.02.037_b3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1103\/PhysRevLett.59.381","volume":"59","author":"Bak","year":"1987","journal-title":"Physics Review Letters"},{"key":"10.1016\/j.tcs.2008.02.037_b4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF01275667","article-title":"Edge-isoperimetric inequalities in the grid","volume":"11","author":"Bollob\u00e1s","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/j.tcs.2008.02.037_b5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<3::AID-JGT1>3.0.CO;2-R","article-title":"Open problems of Paul Erd\u0151s in graph theory","volume":"25","author":"Chung","year":"1997","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/j.tcs.2008.02.037_b6","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1088\/0305-4470\/28\/4\/009","article-title":"Algebraic aspects of sandpile models","volume":"28","author":"Dhar","year":"1995","journal-title":"Journal of Physics A"},{"key":"10.1016\/j.tcs.2008.02.037_b7","unstructured":"D. Dyer, Sweeping graphs and digraphs, Ph.D. Thesis, Simon Fraser University, 2004"},{"key":"10.1016\/j.tcs.2008.02.037_b8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/S0895480192240287","article-title":"Chip firing games on mutating graphs","volume":"9","author":"Eriksson","year":"1996","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/j.tcs.2008.02.037_b9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1142\/S0219265903000945","article-title":"Layout area of the hypercube","volume":"4","author":"Even","year":"2003","journal-title":"Journal of Interconnection Networks"},{"key":"10.1016\/j.tcs.2008.02.037_b10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.jctb.2004.09.008","article-title":"Path decompositions and Gallai\u2019s conjecture","volume":"93","author":"Fan","year":"2005","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/j.tcs.2008.02.037_b11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","article-title":"Optimal assignments of numbers to vertices","volume":"12","author":"Harper","year":"1964","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"10.1016\/j.tcs.2008.02.037_b12","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0195-6698(03)00063-5","article-title":"Classes of lattices induced by chip firing (and sandpile) dynamics","volume":"24","author":"Magnien","year":"2003","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/j.tcs.2008.02.037_b13","unstructured":"S. McKeil, Chip firing cleaning processes, M.Sc. Thesis, Dalhousie University, 2007"},{"key":"10.1016\/j.tcs.2008.02.037_b14","doi-asserted-by":"crossref","first-page":"1844","DOI":"10.1145\/42267.42268","article-title":"The complexity of searching a graph","volume":"35","author":"Megiddo","year":"1988","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.tcs.2008.02.037_b15","doi-asserted-by":"crossref","unstructured":"C. Merino, The chip firing game and matroid complexes, in discrete models: combinatorics, computation, and geometry, DM-CCG 2001, in: Discrete Mathematics and Theoretical Computer Science Proceedings AA, 2001, pp.\u00a0245\u2013256","DOI":"10.46298\/dmtcs.2278"},{"key":"10.1016\/j.tcs.2008.02.037_b16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1142\/S0129054103001637","article-title":"Linear layout of generalized hypercubes","volume":"14","author":"Nakano","year":"2003","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10.1016\/j.tcs.2008.02.037_b17","series-title":"Theory and Applications of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","author":"Parsons","year":"1976"},{"key":"10.1016\/j.tcs.2008.02.037_b18","unstructured":"T.\u00a0D. Parsons, The search number of a connected graph, in: Proc. Ninth Southeastern Conf. Combinatorics, Graph Theory and Computing, Congressus Numerantium XXI, Winnipeg, 1978, pp.\u00a0549\u2013554"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397508001576?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397508001576?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T03:08:44Z","timestamp":1630984124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397508001576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["S0304397508001576"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2008.02.037","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}