Fully Dynamic Algorithms for Chordal Graphs

@inproceedings{Ibarra1999FullyDA,
  title={Fully Dynamic Algorithms for Chordal Graphs},
  author={Louis Ibarra},
  booktitle={SODA},
  year={1999}
}
We present the fist dynamic algorithm to support the following operations on a chordal graph: (1) test whether deleting or inserting an arbitrary edge maintains chordality, (2) delete or insert an arbitrary edge, provided it maintains chordahty. The algorithm also maintains a clique tree of the graph: which provides the graph’s clique number and chromatic number. We give two implementations. In the first, each operation runs in O(n) time, where n is the number of vertices. In the second… CONTINUE READING
22 Citations
0 References
Similar Papers

Similar Papers

Loading similar papers…