{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:47Z","timestamp":1725558947421},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_11","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"129-141","source":"Crossref","is-referenced-by-count":0,"title":["Coloring a Graph Using Split Decomposition"],"prefix":"10.1007","author":[{"given":"Micha\u00ebl","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"11_CR2","first-page":"221","volume":"21","author":"R. Bixby","year":"1984","unstructured":"Bixby, R.: A composition for perfect graphs. Annals of Discrete Math.\u00a021, 221\u2013224 (1984)","journal-title":"Annals of Discrete Math"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-45077-1_7","volume-title":"Fundamentals of Computation Theory","author":"H.L. Bodlaender","year":"2003","unstructured":"Bodlaender, H.L., Brandst\u00e4dt, A., Kratsch, D., Rao, M., Spinrad, J.P.: Linear time algorithms for some NP-complete problems on (P\n 5,gem)-free graphs. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 61\u201372. Springer, Heidelberg (2003)"},{"key":"11_CR4","first-page":"14","volume":"7","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nord. J. Comput.\u00a07, 14\u201331 (2000)","journal-title":"Nord. J. Comput."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00453-003-1026-5","volume":"36","author":"H.L. Bodlaender","year":"2003","unstructured":"Bodlaender, H.L., Rotics, U.: Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica\u00a036, 375\u2013408 (2003)","journal-title":"Algorithmica"},{"key":"11_CR6","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the structure of (P5,gem)-free graphs, Manuscript (2002), http:\/\/www.informatik.uni-rostock.de\/(en)\/\u00a0ab\/ps-files\/p5gemdam.ps"},{"key":"11_CR7","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem, Manuscript (2002), \n \n http:\/\/www.math.gatech.edu\/~thomas\/spgc.ps.gz"},{"key":"11_CR8","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 Math.\u00a095, 181\u2013195 (1999)","journal-title":"Discrete Applied Math"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W. Cunningham","year":"1982","unstructured":"Cunningham, W.: Decomposition of directed graphs. SIAM Journal on Algebraic and Discrete Methods\u00a03, 214\u2013228 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"11_CR12","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, 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 117\u2013128. Springer, Heidelberg (2001)"},{"key":"11_CR14","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, 435\u2013473 (1989)","journal-title":"Journal of the ACM"},{"key":"11_CR15","first-page":"325","volume":"21","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. Annals of Discrete Math.\u00a021, 325\u2013356 (1984)","journal-title":"Annals of Discrete Math"},{"key":"11_CR16","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 Math\u00a027, 85\u201399 (1990)","journal-title":"Discrete Applied Math"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(94)90004-3","volume":"55","author":"C.T. Ho\u2018ang","year":"1994","unstructured":"Ho\u00e0ng, C.T.: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs. Discrete Applied Math.\u00a055, 133\u2013143 (1994)","journal-title":"Discrete Applied Math"},{"key":"11_CR18","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 Math.\u00a0126, 197\u2013221 (2003)","journal-title":"Discrete Applied Math"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/jagm.1994.1007","volume":"16","author":"T.-H. Ma","year":"1994","unstructured":"Ma, T.-H., Spinrad, J.: An O(n2) algorithm for undirected split decomposition. Journal of Algorithms\u00a016, 154\u2013160 (1994)","journal-title":"Journal of Algorithms"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Math.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math"},{"key":"11_CR21","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 Math.\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Math."},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(99)00114-6","volume":"100","author":"T. Raschle","year":"2000","unstructured":"Raschle, T., Simon, K.: On the P4-components of graphs. Discrete Applied Math\u00a0100, 215\u2013235 (2000)","journal-title":"Discrete Applied Math"},{"key":"11_CR23","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"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math.\u00a055, 221\u2013232 (1985)","journal-title":"Discrete Math"},{"key":"11_CR25","unstructured":"Vanherpe, J.-M.: D\u00e9composition et algorithmes efficaces sur les graphes, Ph.D. thesis, Universit\u00e9 de Picardie, LaRIA (1999)"}],"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-540-30559-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:56Z","timestamp":1620012596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}