Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny

14 years 5 months ago

We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.

Anne Berry, Alain Sigayret, Jeremy Spinrad

Chordal Graph | Computer Science | Current Complexities | WG 2005 |

claim paper

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WG
Authors	Anne Berry, Alain Sigayret, Jeremy Spinrad

Comments (0)