Chapter

Graph-Theoretic Concepts in Computer Science

Volume 3787 of the series Lecture Notes in Computer Science pp 445-455

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

  • Anne BerryAffiliated withLIMOS UMR, bat. ISIMA
  • , Alain SigayretAffiliated withLIMOS UMR, bat. ISIMA
  • , Jeremy SpinradAffiliated withEECS dept, Vanderbilt University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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