Abstract
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia, USA (1999)
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 – Recent Advances in Knowledge Discovery, vol. 1900(01) (2005)
Buneman, P.: A characterization of rigid circuit graphs. Discrete Mathematics 9, 205–212 (1974)
Coppersmith, D., Winograd, S.: On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput. 11(3), 472–492 (1982)
Gàvril, F.: The intersection graphs of subtrees of trees are exactly the chordal graphs. Journal of Combinatorial Theory B 16, 47–56 (1974)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
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–207 (1999)
Ibarra, L.: Fully Dynamic Algorithms for Chordal and Split Graphs. In: Proc. 10th Annual ACM-SIAM Synposium on Discrete Algorithms SODA 1999, pp. 923–924 (1999)
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–426 (1997)
Spinrad, J.P.: Efficient Graph Representation. Fields Institute Monographs 19, 324p. American Mathematics Society, Providence (2003)
Spinrad, J., Sritharan, R.: Algorithms for Weakly Triangulated Graphs. Discrete Applied Mathematics 59, 181–191 (1995)
Walter, J.R.: Representations of Rigid Circuit Graphs. PhD. Dissertation, Wayne State University, Detroit, USA (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berry, A., Sigayret, A., Spinrad, J. (2005). Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_39
Download citation
DOI: https://doi.org/10.1007/11604686_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)