Dynamic algorithms for chordal and interval graphs
We present the first dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting an arbitrary edge preserves chordality, (2) delete or insert an arbitrary edge, provided it preserves chordality. We gi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://dspace.library.uvic.ca//handle/1828/9596 |