Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/1981
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHell, Pavol-
dc.contributor.authorKlein, Sulamita-
dc.contributor.authorProtti, Fábio-
dc.contributor.authorTito, Loana-
dc.date.accessioned2017-05-12T13:25:01Z-
dc.date.available2017-05-14T03:00:11Z-
dc.date.issued2000-12-31-
dc.identifier.citationHELL, 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.urihttp://hdl.handle.net/11422/1981-
dc.description.abstractA 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.languageengpt_BR
dc.relation.ispartofRelatório Técnico NCEpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectGrafo cordalpt_BR
dc.subjectTeoria dos grafospt_BR
dc.titleChordal (2,1) - graphsen
dc.typeRelatóriopt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaispt_BR
dc.subject.cnpqCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOpt_BR
dc.citation.issue0100pt_BR
dc.embargo.termsabertopt_BR
Appears in Collections:Relatórios

Files in This Item:
File Description SizeFormat 
01_00_000612714.pdf596.58 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.