| Article ID: | iaor2009597 |
| Country: | Netherlands |
| Volume: | 157 |
| Issue: | 1 |
| Start Page Number: | 47 |
| End Page Number: | 60 |
| Publication Date: | Jan 2008 |
| Journal: | Annals of Operations Research |
| Authors: | Markenzon Lilian, Vernet Oswaldo, Araujo Luiz Henrique |
In this paper two methods for automatic generation of connected chordal graphs are proposed: the first one is based on new results concerning the dynamic maintenance of chordality under edge insertions; the second is based on expansion/merging of maximal cliques. Theoretical and experimental results are presented. In both methods, chordality is preserved along the whole generation process.