Pantheon Institutional repository
Collect, preserve and disseminate digital academic production in all areas of knowledge.
Comprise the assets of the repository, in addition to theses and dissertations at UFRJ, scientific articles, electronic books, book chapters and papers presented at events for teachers, researchers, administrative staff and students of master's and doctoral degrees.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/1981| Type: | Relatório |
| Title: | Chordal (2,1) - graphs |
| Author(s)/Inventor(s): | Hell, Pavol Klein, Sulamita Protti, Fábio Tito, Loana |
| Abstract: | 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. |
| Keywords: | Grafo cordal Teoria dos grafos |
| Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
| In: | Relatório Técnico NCE |
| Issue: | 0100 |
| Issue Date: | 31-Dec-2000 |
| Publisher country: | Brasil |
| Language: | eng |
| Right access: | Acesso Aberto |
| Citation: | HELL, P. et al. Chordal (2,1) - graphs -. Rio de Janeiro: NCE, UFRJ, 2000. 09 p. (Relatório Técnico, 01/00) |
| Appears in Collections: | Relatórios |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 01_00_000612714.pdf | 596.58 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.