乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:05:16Z","timestamp":1725807916793},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_28","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"336-347","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Number of Connected Sets in Bounded Degree Graphs"],"prefix":"10.1007","author":[{"given":"Kustaa","family":"Kangas","sequence":"first","affiliation":[]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[]},{"given":"Janne H.","family":"Korhonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02772952","volume":"73","author":"N Alon","year":"1991","unstructured":"Alon, N.: Independent sets in regular graphs and sum-free subsets of finite groups. Isr. J. Math. 73, 247\u2013256 (1991)","journal-title":"Isr. J. Math."},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-011-9575-5","volume":"65","author":"D Binkele-Raible","year":"2013","unstructured":"Binkele-Raible, D., Fernau, H., Gaspers, S., Liedloff, M.: Exact and parameterized algorithms for max internal spanning tree. Algorithmica 65(1), 95\u2013128 (2013)","journal-title":"Algorithmica"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: FOCS, pp. 677\u2013686. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.40"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s00224-009-9185-7","volume":"47","author":"A Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Moebius inversion and graphs of bounded degree. Theor. Comput. Syst. 47(3), 637\u2013654 (2010)","journal-title":"Theor. Comput. Syst."},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2151171.2151181","volume":"8","author":"A Bj\u00f6rklund","year":"2012","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8(2), 18:1\u201318:13 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: The Art of Mathematics: Coffee Time in Memphis. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511816574"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F Chung","year":"1986","unstructured":"Chung, F., Graham, R., Frankl, P., Shearer, J.: Some intersection theorems for ordered sets and graphs. J. Comb. Theor. Ser. A 43(1), 23\u201337 (1986)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica 52(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1), 9:1\u20139:17 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"28_CR10","unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Marion, J.Y., Schwentick, T. (eds.) STACS. Volume 5 of LIPIcs., Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 383\u2013394 (2010)"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00493-012-2536-z","volume":"32","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. Combinatorica 32(3), 289\u2013308 (2012)","journal-title":"Combinatorica"},{"issue":"23\u201324","key":"28_CR12","doi-asserted-by":"publisher","first-page":"6635","DOI":"10.1016\/j.disc.2009.06.031","volume":"309","author":"D Galvin","year":"2009","unstructured":"Galvin, D.: An upper bound for the number of independent sets in regular graphs. Discrete Math. 309(23\u201324), 6635\u20136640 (2009)","journal-title":"Discrete Math."},{"issue":"3\u20134","key":"28_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s00453-010-9474-1","volume":"62","author":"S Gaspers","year":"2012","unstructured":"Gaspers, S., Kratsch, D., Liedloff, M.: On independent sets and bicliques in graphs. Algorithmica 62(3\u20134), 637\u2013658 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1002\/jgt.21631","volume":"72","author":"S Gaspers","year":"2013","unstructured":"Gaspers, S., Mnich, M.: Feedback vertex sets in tournaments. J. Graph Theory 72(1), 72\u201389 (2013)","journal-title":"J. Graph Theory"},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S0963548301004631","volume":"10","author":"J Kahn","year":"2001","unstructured":"Kahn, J.: An entropy approach to the hard-core model on bipartite graphs. Combin. Probab. Comput. 10, 219\u2013237 (2001)","journal-title":"Combin. Probab. Comput."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Isr. J. Math. 3, 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"key":"28_CR17","first-page":"2251","volume":"9","author":"E Perrier","year":"2008","unstructured":"Perrier, E., Imoto, S., Miyano, S.: Finding optimal Bayesian network given a super-structure. J. Mach. Learn. Res. 9, 2251\u20132286 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y Zhao","year":"2010","unstructured":"Zhao, Y.: The number of independent sets in a regular graph. Combin. Probab. Comput. 19, 315\u2013320 (2010)","journal-title":"Combin. Probab. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T23:56:26Z","timestamp":1674172586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}