{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:52Z","timestamp":1725552172763},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_39","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"445-455","source":"Crossref","is-referenced-by-count":2,"title":["Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny"],"prefix":"10.1007","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Spinrad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia, USA (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"39_CR2","unstructured":"Berry, A., Sigayret, A., Sinoquet, C.: Maximal Sub-Triangulation as Improving Phylogenetic Data. In: Govaert, G., Haenle, R., Nadif, M. (eds.) Proceedings of JIM 2003. Soft Computing \u2013 Recent Advances in Knowledge Discovery, vol.\u00a01900(01) (2005)"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterization of rigid circuit graphs. Discrete Mathematics\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"39_CR4","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0211038","volume":"11","author":"D. Coppersmith","year":"1982","unstructured":"Coppersmith, D., Winograd, S.: On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput.\u00a011(3), 472\u2013492 (1982)","journal-title":"SIAM J. Comput."},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. G\u00e0vril","year":"1974","unstructured":"G\u00e0vril, F.: The intersection graphs of subtrees of trees are exactly the chordal graphs. Journal of Combinatorial Theory B\u00a016, 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory B"},{"key":"39_CR6","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Huson, D., Nettles, S., Warnow, T.: Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. In: Proc. RECOMB 1999, Lyon, France, pp. 198\u2013207 (1999)","DOI":"10.1145\/299432.299484"},{"key":"39_CR8","unstructured":"Ibarra, L.: Fully Dynamic Algorithms for Chordal and Split Graphs. In: Proc. 10th Annual ACM-SIAM Synposium on Discrete Algorithms SODA 1999, pp. 923\u2013924 (1999)"},{"key":"39_CR9","unstructured":"Kearney, P., Hayward, R., Meijer, H.: Inferring evolutionary trees from ordinal data. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1997, pp. 418\u2013426 (1997)"},{"key":"39_CR10","series-title":"Fields Institute Monographs 19","first-page":"324","volume-title":"Efficient Graph Representation","author":"J.P. Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representation. Fields Institute Monographs 19, 324p. American Mathematics Society, Providence (2003)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"J. Spinrad","year":"1995","unstructured":"Spinrad, J., Sritharan, R.: Algorithms for Weakly Triangulated Graphs. Discrete Applied Mathematics\u00a059, 181\u2013191 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR12","unstructured":"Walter, J.R.: Representations of Rigid Circuit Graphs. PhD. Dissertation, Wayne State University, Detroit, USA (1972)"}],"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\/11604686_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:29Z","timestamp":1619507069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11604686_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}