Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)
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.
© Springer-Verlag Berlin Heidelberg 2005