乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:40:49Z","timestamp":1648618849536},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T00:00:00Z","timestamp":1639699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T00:00:00Z","timestamp":1639699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Top Young-aged Talents Program of Hebei Province"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00373-021-02415-5","type":"journal-article","created":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T13:07:07Z","timestamp":1640005627000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decomposition and Merging Algorithms for Noncrossing Forests"],"prefix":"10.1007","volume":"38","author":[{"given":"Sabrina X. M.","family":"Pang","sequence":"first","affiliation":[]},{"given":"Lun","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"2415_CR1","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1016\/j.ejc.2007.06.005","volume":"29","author":"A Asinowski","year":"2008","unstructured":"Asinowski, A., Mansour, T.: Dyck paths with coloured ascents. Euro. J. Combin. 29, 1262\u20131279 (2008)","journal-title":"Euro. J. Combin."},{"key":"2415_CR2","doi-asserted-by":"publisher","first-page":"9635","DOI":"10.1073\/pnas.87.24.9635","volume":"87","author":"WYC Chen","year":"1990","unstructured":"Chen, W.Y.C.: A general bijective algorithm for trees. Proc. Natl. Acad. Sci. 87, 9635\u20139639 (1990)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2415_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W.Y.C., Yan, S.H.F.: Noncrossing trees and noncrossing graphs. Electron. J. Combin. 13, #N12 (2006)","DOI":"10.37236\/1150"},{"key":"2415_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0012-365X(01)00366-1","volume":"254","author":"E Deutsch","year":"2002","unstructured":"Deutsch, E., Noy, M.: Statistics on non-crossing trees. Discrete Math. 254, 75\u201387 (2002)","journal-title":"Discrete Math."},{"key":"2415_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0012-365X(98)00372-0","volume":"204","author":"P Flajolet","year":"1999","unstructured":"Flajolet, P., Noy, M.: Analytic combinatorics of non-crossing configurations. Discrete Math. 204, 203\u2013229 (1999)","journal-title":"Discrete Math."},{"key":"2415_CR6","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"RL Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley (1994)","edition":"2"},{"key":"2415_CR7","doi-asserted-by":"crossref","unstructured":"Guo, A.: Cyclic sieving phenomenon in non-crossing connected graphs. Electron. J. Combin. 18(1) #P9 (2011)","DOI":"10.37236\/496"},{"key":"2415_CR8","doi-asserted-by":"crossref","unstructured":"Hough, D.S.: Descents in noncrossing trees. Electron. J. Combin. 10, #N13 (2003)","DOI":"10.37236\/1753"},{"key":"2415_CR9","doi-asserted-by":"crossref","unstructured":"Kluge, S.: The cyclic sieving phenomenon for non-crossing forests. Electron. J. Combin. 19(3) #P1 (2012)","DOI":"10.37236\/2419"},{"key":"2415_CR10","doi-asserted-by":"crossref","unstructured":"Lv, L., Pang, S.X.M.: A decomposition algorithm for noncrossing trees. Electron. J. Combin. 21 #P1.5 (2014)","DOI":"10.37236\/3353"},{"key":"2415_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0012-365X(97)00121-0","volume":"180","author":"M Noy","year":"1998","unstructured":"Noy, M.: Enumeration of noncrossing trees on a circle. Discrete Math. 180, 301\u2013313 (1998)","journal-title":"Discrete Math."},{"key":"2415_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0012-365X(01)00282-5","volume":"250","author":"A Panholzer","year":"2002","unstructured":"Panholzer, A., Prodinger, H.: Bijections for ternary trees and non-crossing trees. Discrete Math. 250, 181\u2013195 (2002)","journal-title":"Discrete Math."},{"key":"2415_CR13","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Published electronically at http:\/\/oeis.org\/"},{"key":"2415_CR14","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00373-010-0950-9","volume":"26","author":"Y Sun","year":"2010","unstructured":"Sun, Y., Wang, Z.: Consecutive pattern avoidances in non-crossing trees. Graphs Combin. 26, 815\u2013832 (2010)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02415-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02415-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02415-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T17:03:56Z","timestamp":1646759036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02415-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,17]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["2415"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02415-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,17]]},"assertion":[{"value":"22 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}