Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/1981
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hell, Pavol | - |
dc.contributor.author | Klein, Sulamita | - |
dc.contributor.author | Protti, Fábio | - |
dc.contributor.author | Tito, Loana | - |
dc.date.accessioned | 2017-05-12T13:25:01Z | - |
dc.date.available | 2023-12-21T03:00:57Z | - |
dc.date.issued | 2000-12-31 | - |
dc.identifier.citation | HELL, P. et al. Chordal (2,1) - graphs -. Rio de Janeiro: NCE, UFRJ, 2000. 09 p. (Relatório Técnico, 01/00) | pt_BR |
dc.identifier.uri | http://hdl.handle.net/11422/1981 | - |
dc.description.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. | pt_BR |
dc.language | eng | pt_BR |
dc.relation.ispartof | Relatório Técnico NCE | pt_BR |
dc.rights | Acesso Aberto | pt_BR |
dc.subject | Grafo cordal | pt_BR |
dc.subject | Teoria dos grafos | pt_BR |
dc.title | Chordal (2,1) - graphs | en |
dc.type | Relatório | pt_BR |
dc.publisher.country | Brasil | pt_BR |
dc.publisher.department | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais | pt_BR |
dc.subject.cnpq | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO | pt_BR |
dc.citation.issue | 0100 | pt_BR |
dc.embargo.terms | aberto | pt_BR |
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.