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

  • Anne Berry
  • Alain Sigayret
  • Jeremy Spinrad
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)

Abstract

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Anne Berry
    • 1
  • Alain Sigayret
    • 1
  • Jeremy Spinrad
    • 2
  1. 1.LIMOS UMR, bat. ISIMAAubièreFrance
  2. 2.EECS deptVanderbilt UniversityNashvilleUSA

Personalised recommendations