Two methods for the generation of chordal graphs
In this paper two methods for automatic generation of connected chordal graphs are proposed: the first one is based on results concerning the dynamic maintainance of chordality under edge insertions; the second is based on expansion/merging of maximal cliques. In both methods, chordality is preserve...
| Autores: | , , |
|---|---|
| Formato: | informe técnico |
| Estado: | Versión publicada |
| Fecha de publicación: | 2004 |
| País: | Brasil |
| Recursos: | Universidade Federal do Rio de Janeiro (UFRJ) |
| Repositorio: | Repositório Institucional da UFRJ |
| Idioma: | inglés |
| OAI Identifier: | oai:pantheon.ufrj.br:11422/1930 |
| Acesso em linha: | http://hdl.handle.net/11422/1930 |
| Access Level: | acceso abierto |
| Palavra-chave: | Grafos cordal Chordal graphs CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Resumo: | In this paper two methods for automatic generation of connected chordal graphs are proposed: the first one is based on results concerning the dynamic maintainance of chordality under edge insertions; the second is based on expansion/merging of maximal cliques. In both methods, chordality is preserved along the whole generation process. |
|---|