Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n 2) update-time

Authors:
Mauro Mezzini
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2012

Citing 18
Cited 0

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Existence of extensions and product extensions for discrete probability distributions

Discrete Mathematics
The evolution of the minimum degree ordering algorithm

SIAM Review
Modification of the minimum-degree algorithm by multiple elimination

ACM Transactions on Mathematical Software (TOMS)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
A practical algorithm for making filled graphs minimal

Theoretical Computer Science
A sufficiently fast algorithm for finding close to optimal clique trees

Artificial Intelligence
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

Algorithmica
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)

SIAM Journal on Discrete Mathematics
Fully dynamic algorithms for chordal graphs and split graphs

ACM Transactions on Algorithms (TALG)
Fast Computation of Minimal Fill Inside A Given Elimination Ordering

SIAM Journal on Matrix Analysis and Applications
A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network

Theoretical Computer Science
Fast minimal triangulation algorithm using minimum degree criterion

Theoretical Computer Science
Efficient stepwise selection in decomposable models

UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Maximum likelihood bounded tree-width Markov networks

UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
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	5.23

Visualization

Abstract

We propose dynamic algorithms and data structures for chordal graphs supporting the following operation: determine if an edge can be added or removed from the graph while preserving the chordality in O(1) time. We show that the complexity of the algorithms for updating the data structures when an edge is actually inserted or deleted is O(n^2) where n is the number of vertices of the graph.