Chordal (2,1) - graphs
A graph is said to be (k, l) if itsif its vertex set can be partitioned into k independent sets and l cliques. The class of (k,l) graphsappears as a natural generalization of split graphs. In this paper, we describe a characterization leads to a O (nm) recognition algorithm, where n and m are the nu...
| Autores: | , , , |
|---|---|
| Formato: | informe técnico |
| Estado: | Versión publicada |
| Fecha de publicación: | 2000 |
| 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/1981 |
| Acesso em linha: | http://hdl.handle.net/11422/1981 |
| Access Level: | acceso abierto |
| Palavra-chave: | Grafo cordal Teoria dos grafos CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Resumo: | A graph is said to be (k, l) if itsif its vertex set can be partitioned into k independent sets and l cliques. The class of (k,l) graphsappears as a natural generalization of split graphs. In this paper, we describe a characterization leads to a O (nm) recognition algorithm, where n and m are the numbers of vertices and edges of the input graph, respectively. |
|---|