{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:14Z","timestamp":1725497234393},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"},{"type":"electronic","value":"9783540771203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77120-3_6","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"41-51","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic Distance Hereditary Graphs Using Split Decomposition"],"prefix":"10.1007","author":[{"given":"Emeric","family":"Gioan","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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. J. Combin. Theory Ser. B\u00a041, 182\u2013208 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"6_CR3","unstructured":"Bretscher, A.: LexBFS based recognition algorithms for cographs and related families. PhD thesis, Dep. of Computer Science, University of Toronto (2005)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/10719839_14","volume-title":"LATIN 2000: Theoretical Informatics","author":"D. Corneil","year":"2000","unstructured":"Corneil, D., Habib, M., Lanlignel, J.-M., Reed, B., Rotics, U.: Polynomial Time Recognition of Clique-Width \u2264\u20093 Graphs. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 126\u2013134. Springer, Heidelberg (2000)"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D. Corneil","year":"1985","unstructured":"Corneil, D., Perl, Y., Stewart, L.K.: A linear time recognition algorithms for cographs. SIAM J. Comput.\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 2007","author":"D. Corneil","year":"2007","unstructured":"Corneil, D., Tedder, M.: An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, Springer, Heidelberg (2007)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-30559-0_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Crespelle","year":"2004","unstructured":"Crespelle, C., Paul, C.: Fully-dynamic recognition algorithm and certificate for directed cographs. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 93\u2013104. Springer, Heidelberg (2004) Discrete Appl. Math. 154(12), 1722\u20131741 (2006)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/11604686_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Crespelle","year":"2005","unstructured":"Crespelle, C., Paul, C.: Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 38\u201348. Springer, Heidelberg (2005)"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Alg. Disc. Meth.\u00a03, 214\u2013228 (1982)","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"2","key":"6_CR10","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":"6_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","volume":"263","author":"G. Damiand","year":"2001","unstructured":"Damiand, G., Habib, M., Paul, C.: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Th. Comp. Sci.\u00a0263, 99\u2013111 (2001)","journal-title":"Th. Comp. Sci."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Algorithms and Theory of Computation Handbook, ch.\u00a08, CRC Press (1999)","DOI":"10.1201\/9781420049503-c9"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11618058_16","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2006","unstructured":"Eppstein, D., Goodrich, M.T., Yu Meng, J.: Delta-confluent drawings. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 165\u2013176. Springer, Heidelberg (2006)"},{"key":"6_CR14","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 Acad. Sci. Hungar.\u00a018, 25\u201366 (1967)","journal-title":"Acta Mathematica Acad. Sci. Hungar."},{"key":"6_CR15","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 Appl. Math.\u00a027, 85\u201399 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0097539700372216","volume":"31","author":"P. Hell","year":"2002","unstructured":"Hell, P., Shamir, R., Sharan, R.: A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM J. Comput.\u00a031(1), 289\u2013305 (2002)","journal-title":"SIAM J. Comput."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45655-4_10","volume-title":"Computing and Combinatorics","author":"S.-Y. Hseih","year":"2002","unstructured":"Hseih, S.-Y., Ho, C.-W., Hsu, T.-S., Ho, M.-T.: Efficient algorithms for the hamiltonian problem on distance hereditary graphs. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 77\u201386. Springer, Heidelberg (2002)"},{"key":"6_CR18","unstructured":"Ibarra, L.: Fully dynamic algorithms for chordal graphs. In: Proc. 10th ACM-SIAM Annual Symp. on Disc. Algorithm (SODA), pp. 923\u2013924 (1999)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"McKee, T., McMorris, F.R.: Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications\u00a02 (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S.I. Oum","year":"2005","unstructured":"Oum, S.I.: Rank-width and vertex-minors. J. Combin. Th. Ser. B\u00a095, 79\u2013100 (2005)","journal-title":"J. Combin. Th. Ser. B"},{"issue":"2-3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0166-218X(03)00448-7","volume":"136","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and recognition of cographs. Discrete Appl. Math.\u00a0136(2-3), 329\u2013340 (2004)","journal-title":"Discrete Appl. Math."},{"key":"6_CR22","unstructured":"Spinrad, J.: List of open problems. \n                    \n                      www.vuse.vanderbilt.edu\/~spin\/open.html"},{"key":"6_CR23","unstructured":"Uehara, R., Uno, Y.: Canonical tree representation of distance hereditary graphs and its applications. IEICE Technical Report COMP2005-61 (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:26:53Z","timestamp":1558279613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540771180","9783540771203"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}