{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:14Z","timestamp":1759638254110},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_19","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"214-225","source":"Crossref","is-referenced-by-count":2,"title":["Directed Rank-Width and Displit Decomposition"],"prefix":"10.1007","author":[{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"first","affiliation":[]},{"given":"Micha\u00ebl","family":"Rao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.J. Bandelt","year":"1986","unstructured":"Bandelt, H.J., Mulder, H.M.: Distance-Hereditary Graphs. Journal of Combinatorial Theory, Series B\u00a041(2), 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive Hypergraphs. Discrete Mathematics\u00a037(1), 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"issue":"1-3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(99)00074-8","volume":"95","author":"S. Cicerone","year":"1999","unstructured":"Cicerone, S., Di Stefano, D.: On the Extension of Bipartite Graphs to Parity Graphs. Discrete Applied Mathematics\u00a095(1-3), 181\u2013195 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper Bounds to the Clique-Width of Graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of Directed Graphs. SIAM Journal on Algebraic and Discrete Methods\u00a03(2), 214\u2013228 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W.H. Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A Combinatorial Decomposition Theory. Canadian Journal of Mathematics\u00a032, 734\u2013765 (1980)","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. Journal of Algorithms\u00a036(2), 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"key":"19_CR8","doi-asserted-by":"crossref","DOI":"10.1142\/4197","volume-title":"The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs","author":"A. Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"C.P. Gabor","year":"1989","unstructured":"Gabor, C.P., Hsu, W.L., Supowit, K.J.: Recognizing Circle Graphs in Polynomial-Time. Journal of the ACM\u00a036(3), 435\u2013473 (1989)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae\u00a018(1-2), 25\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(03)00232-2","volume":"273","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Distance Labeling Scheme and Split Decomposition. Discrete Mathematics\u00a0273(1), 115\u2013130 (2003)","journal-title":"Discrete Mathematics"},{"issue":"1-2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P. Hammer","year":"1990","unstructured":"Hammer, P., Maffray, F.: Completely Separable Graphs. Discrete Applied Mathematics\u00a027(1-2), 85\u201399 (1990)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"19_CR13","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)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Graph Theory, Computational Intelligence and Thought","author":"B.L. Joeris","year":"2008","unstructured":"Joeris, B.L., Lundberg, S., McConnell, R.M.: O(mlogn) Split Decomposition of Strongly-Connected Graphs. In: Proceedings of Graph Theory, Computational Intelligence and Thought. LNCS. Springer, Heidelberg (2008)"},{"key":"19_CR15","unstructured":"Kant\u00e9, M.M.: The Rank-Width of Directed Graphs (2009) (in revision)"},{"key":"19_CR16","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2005.06.039","volume":"22","author":"F. Montgolfier de","year":"2005","unstructured":"de Montgolfier, F., Rao, M.: The Bi-Join Decomposition. Electronic Notes in Discrete Mathematics\u00a022, 173\u2013177 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S. Oum","year":"2005","unstructured":"Oum, S.: Rank-Width and Vertex-Minors. Journal of Combinatorial Theory, Series B\u00a095(1), 79\u2013100 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"19_CR19","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.D.: 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":"14","key":"19_CR20","doi-asserted-by":"publisher","first-page":"2768","DOI":"10.1016\/j.dam.2007.11.013","volume":"156","author":"M. Rao","year":"2008","unstructured":"Rao, M.: Solving some NP-complete problems using split decomposition. Discrete Applied Mathematics\u00a0156(14), 2768\u20132780 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"J. Spinrad","year":"1994","unstructured":"Spinrad, J.: Recognition of Circle Graphs. Journal of Algorithms\u00a016, 264\u2013282 (1994)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:01Z","timestamp":1619783521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}