乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T13:50:31Z","timestamp":1723125031987},"reference-count":28,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,4,6]],"date-time":"2014-04-06T00:00:00Z","timestamp":1396742400000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1016\/j.dam.2009.09.009","type":"journal-article","created":{"date-parts":[[2009,10,4]],"date-time":"2009-10-04T00:00:22Z","timestamp":1254614422000},"page":"809-819","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"title":["H<\/mml:mi><\/mml:math>-join decomposable graphs and algorithms with runtime single exponential in rankwidth"],"prefix":"10.1016","volume":"158","author":[{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"first","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Vatshelle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2009.09.009_b1","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","article-title":"The probabilistic method","author":"Alon","year":"2000"},{"issue":"1","key":"10.1016\/j.dam.2009.09.009_b2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548306007887","article-title":"The minimum feedback arc set problem is NP-hard for tournaments","volume":"16","author":"Charbit","year":"2007","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"10.1016\/j.dam.2009.09.009_b3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Annals of Mathematics"},{"issue":"4","key":"10.1016\/j.dam.2009.09.009_b4","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1137\/S0097539701385351","article-title":"On the relationship between clique-width and treewidth","volume":"34","author":"Corneil","year":"2005","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/j.dam.2009.09.009_b5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","article-title":"Compositions for perfect graphs","volume":"55","author":"Cornu\u00e9jols","year":"1985","journal-title":"Discrete Mathematics"},{"issue":"4","key":"10.1016\/j.dam.2009.09.009_b6","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.dam.2008.08.026","article-title":"Graph operations characterizing rank-width","volume":"157","author":"Courcelle","year":"2009","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/j.dam.2009.09.009_b7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique-width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"10.1016\/j.dam.2009.09.009_b8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","article-title":"Vertex-minors, monadic second-order logic, and a conjecture by Seese","volume":"97","author":"Courcelle","year":"2007","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.dam.2009.09.009_b9","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","article-title":"A combinatorial decomposition theory","volume":"32","author":"Cunningham","year":"1980","journal-title":"Canadian Journal of Mathematics"},{"key":"10.1016\/j.dam.2009.09.009_b10","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.dam.2009.09.009_b11","series-title":"26th International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"117","article-title":"How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time","volume":"vol. 2204","author":"Espelage","year":"2001"},{"key":"10.1016\/j.dam.2009.09.009_b12","doi-asserted-by":"crossref","unstructured":"F. Fomin, P. Golovach, D. Lokshtanov, S. Saurabh, Clique-width: On the price of generality, in: 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u20192009, 2009, pp. 825\u2013834","DOI":"10.1137\/1.9781611973068.90"},{"issue":"1\u20133","key":"10.1016\/j.dam.2009.09.009_b13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","article-title":"The complexity of first-order and monadic second-order logic revisited","volume":"130","author":"Frick","year":"2004","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.dam.2009.09.009_b14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare Graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"10.1016\/j.dam.2009.09.009_b15","unstructured":"R. Ganian, P. Hlin\u011bn\u00fd, On parse trees and Myhill\u2013Nerode-type tools for handling graphs of bounded rank-width. Abstract at IWOCA\u201908. (accepted for publication). http:\/\/www.fi.muni.cz\/~hlineny\/Research\/papers\/MNtools-2.pdf"},{"issue":"1-3","key":"10.1016\/j.dam.2009.09.009_b16","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/S0304-3975(02)00725-9","article-title":"Algorithms for vertex-partitioning problems on graphs with fixed clique-width","volume":"299","author":"Gerber","year":"2003","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.dam.2009.09.009_b17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1142\/S0129054199000125","article-title":"Partition refinement techniques: An interesting algorithmic tool kit","volume":"10","author":"Habib","year":"1999","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"10.1016\/j.dam.2009.09.009_b18","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1137\/070685920","article-title":"Finding branch-decompositions and rank-decompositions","volume":"38","author":"Hlin\u011bn\u00fd","year":"2008","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/j.dam.2009.09.009_b19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","article-title":"Width parameters beyond tree-width and their applications","volume":"51","author":"Hlin\u011bn\u00fd","year":"2008","journal-title":"The Computer Journal"},{"issue":"1","key":"10.1016\/j.dam.2009.09.009_b20","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/0095-8956(87)90031-1","article-title":"Decomposition of perfect graphs","volume":"43","author":"Hsu","year":"1987","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2-3","key":"10.1016\/j.dam.2009.09.009_b21","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","article-title":"Edge dominating set and colorings on graphs with fixed clique-width","volume":"126","author":"Kobler","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2009.09.009_b22","unstructured":"S. Oum, Graphs of bounded rank-width, Ph.D. Thesis, Princeton University, 2005"},{"issue":"3","key":"10.1016\/j.dam.2009.09.009_b23","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/jgt.20280","article-title":"Rank-width is less than or equal to branch-width","volume":"57","author":"Oum","year":"2008","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"10.1016\/j.dam.2009.09.009_b24","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","article-title":"Approximating clique-width and branch-width","volume":"96","author":"Oum","year":"2006","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"6","key":"10.1016\/j.dam.2009.09.009_b25","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM Journal on Computing"},{"issue":"1-3","key":"10.1016\/j.dam.2009.09.009_b26","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","article-title":"MSOL partitioning problems on graphs of bounded treewidth and clique-width","volume":"377","author":"Rao","year":"2007","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.dam.2009.09.009_b27","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph minors. X. Obstructions to tree-decomposition","volume":"52","author":"Robertson","year":"1991","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"10.1016\/j.dam.2009.09.009_b28","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","article-title":"Algorithms for vertex partitioning problems on partial k-trees","volume":"10","author":"Telle","year":"1997","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0900362X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0900362X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:37:20Z","timestamp":1660264640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0900362X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["S0166218X0900362X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2009.09.009","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"-join decomposable graphs and algorithms with runtime single exponential in rankwidth","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2009.09.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2009 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}