Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
- Cite this paper as:
- 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
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
Unable to display preview. Download preview PDF.