Faster dynamic algorithms for chordal graphs, and an application to phylogeny

Authors:
Anne Berry;Alain Sigayret;Jeremy Spinrad
Affiliations:
LIMOS UMR, bat. ISIMA, Aubière, France;LIMOS UMR, bat. ISIMA, Aubière, France;EECS dept, Vanderbilt University, nashville, Tn
Venue:
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Year:
2005

Algorithms for weakly triangulated graphs

Discrete Applied Mathematics
Obtaining highly accurate topology estimates of evolutionary trees from very short sequences

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Graph classes: a survey

Graph classes: a survey
Inferring evolutionary trees from ordinal data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Hi-index	0.00

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