A fully dynamic algorithm for recognizing and representing chordal graphs

Authors:
Yrysgul Tursunbay Kyzy
Affiliations:
A.P. Ershov Institute of Informatics Systems, Russian Academy of Sciences, Novosibirsk, Russia
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 5
Cited 0

Counting clique trees and computing perfect elimination schemes in parallel

Information Processing Letters
Fully dynamic algorithms for chordal graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Faster dynamic algorithms for chordal graphs, and an application to phylogeny

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of recognition and representation of dynamically changing chordal graphs. The input to the problem consists of a series of modifications to be performed on a graph, where modifications can be additions or deletions of complete r-vertex graphs. The purpose is to maintain a representation of the graph as long as it remains a chordal graph and to detect when it ceases to be so.