{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:01:49Z","timestamp":1742994109134,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112683"},{"type":"electronic","value":"9783642112690"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_5","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"61-74","source":"Crossref","is-referenced-by-count":6,"title":["Boolean-Width of Graphs"],"prefix":"10.1007","author":[{"given":"B. -M.","family":"Bui-Xuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Vatshelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Adler, I., Vatshelle, M.: Personal communication"},{"key":"5_CR2","unstructured":"Bodlaender, H., Koster, A.: Treewidth Computations I Upper Bounds. Technical Report UU-CS-2008-032, Department of Information and Computing Sciences, Utrecht University (2008)"},{"key":"5_CR3","first-page":"719","volume":"67","author":"A. Brandstaedt","year":"2003","unstructured":"Brandstaedt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria\u00a067, 719\u2013734 (2003)","journal-title":"Ars Combinatoria"},{"key":"5_CR4","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions, \n                    http:\/\/arxiv.org\/abs\/0903.4796+"},{"key":"5_CR5","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. To appear in DAM: special issue of GROW, \n                    http:\/\/www.ii.uib.no\/~telle\/bib\/BTV.pdf"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"D. Corneil","year":"2005","unstructured":"Corneil, D., Rotics, U.: On the relationship between clique-width and treewidth. SIAM Journal on Computing\u00a034(4), 825\u2013847 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48686-0_12","volume-title":"Computing and Combinatorics","author":"C. Damm","year":"1999","unstructured":"Damm, C., Kim, K.H., Roush, F.W.: On covering and rank problems for boolean matrices and their applications. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 123\u2013133. Springer, Heidelberg (1999)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11841036_27","volume-title":"Algorithms \u2013 ESA 2006","author":"F. Dorn","year":"2006","unstructured":"Dorn, F.: Dynamic programming and fast matrix multiplication. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 280\u2013291. Springer, Heidelberg (2006)"},{"key":"5_CR9","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On Parse Trees and Myhill-Nerode-type Tools for handling Graphs of Bounded Rank-width (submitted manuscript), \n                    http:\/\/www.fi.muni.cz\/~hlineny\/Research\/papers\/MNtools+dam3.pdf"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1006\/jctb.2001.2082","volume":"84","author":"J. Geelen","year":"2002","unstructured":"Geelen, J., Gerards, A., Whittle, G.: Branch-width and well-quasi-ordering in matroids and graphs. Journal of Combinatorial Theory, Series B\u00a084(2), 270\u2013290 (2002)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding branch-decompositions and rank-decompositions. SIAM Journal on Computing\u00a038(3), 1012\u20131032 (2008); Abstract at ESA 2007.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. The Computer Journal\u00a051(3), 326\u2013362 (2008)","journal-title":"The Computer Journal"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0095-8956(87)90031-1","volume":"43","author":"W.-L. Hsu","year":"1987","unstructured":"Hsu, W.-L.: Decomposition of perfect graphs. Journal of Combinatorial Theory, Series B\u00a043(1), 70\u201394 (1987)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-92248-3_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V. Jel\u00ednek","year":"2008","unstructured":"Jel\u00ednek, V.: The rank-width of the square grid. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 230\u2013239. Springer, Heidelberg (2008)"},{"key":"5_CR15","volume-title":"Boolean matrix theory and its applications","author":"K.H. Kim","year":"1982","unstructured":"Kim, K.H.: Boolean matrix theory and its applications. Marcel Dekker, New York (1982)"},{"issue":"2-3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics\u00a0126(2-3), 197\u2013221 (2003); Abstract at SODA 2001","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-3-540-24668-8_19","volume-title":"Passive and Active Network Measurement","author":"H.X. Nguyen","year":"2004","unstructured":"Nguyen, H.X., Thiran, P.: Active measurement for multiple link failures diagnosis in IP networks. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol.\u00a03015, pp. 185\u2013194. Springer, Heidelberg (2004)"},{"key":"5_CR18","unstructured":"Oum, S.: Graphs of Bounded Rank-width. PhD thesis, Princeton University (2005)"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.20280","volume":"57","author":"S. Oum","year":"2008","unstructured":"Oum, S.: Rank-width is less than or equal to branch-width. Journal of Graph Theory\u00a057(3), 239\u2013244 (2008)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0378-8733(02)00015-1","volume":"24","author":"P. Pattison","year":"2002","unstructured":"Pattison, P., Breiger, R.: Lattices and dimensional representations: matrix decompositions and ordering structures. Social Networks\u00a024(4), 423\u2013444 (2002)","journal-title":"Social Networks"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B\u00a052(2), 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-04128-0_51","volume-title":"ESA 2009","author":"J. Rooij","year":"2009","unstructured":"Rooij, J., Bodlaender, H., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 566\u2013577. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T20:26:43Z","timestamp":1676060803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}