1. Pantheon
  2. Trabalhos Acadêmicos e Técnicos
  3. Relatórios Técnicos e de Pesquisa
  4. Relatórios
Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2717
Full metadata record
DC FieldValueLanguage
dc.contributor.authorProtti, Fábio-
dc.contributor.authorSzwarcfiter, Jayme Luiz-
dc.date.accessioned2017-08-18T14:17:08Z-
dc.date.available2023-12-21T03:02:47Z-
dc.date.issued2004-12-31-
dc.identifier.citationPROTTI, F; SZWARCFITER, J. L. Clique-inverse graphs of bipartite graphs. Rio de Janeiro: NCE, UFRJ, 1999. 13 p. (Relatório Técnico, 22/99)pt_BR
dc.identifier.urihttp://hdl.handle.net/11422/2717-
dc.description.abstractThe clique graph K (G) of a given graph of the collection of maximal cliques of G. Given a family F of graphs, the clique-inverse graphs of F are the graphs whose clique graphs belong to F. In this work, we describes a characterizations for clique-inverse graphs of bipartite graphs, chordal bipartite graphs, and trees. The characterizations lead to polinomial time algorithms for the corresponding recognition problems.en
dc.languageengpt_BR
dc.relation.ispartofRelatório Técnico NCEpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectInterseção de grafospt_BR
dc.subjectGrafos clique-inversept_BR
dc.subjectGrafos cliquept_BR
dc.subjectIntersection graphsen
dc.subjectClique graphsen
dc.subjectClique-inverse graphsen
dc.titleClique-inverse graphs of bipartite 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 COMPUTACAO::TEORIA DA COMPUTACAOpt_BR
dc.citation.issue2299pt_BR
dc.embargo.termsabertopt_BR
Appears in Collections:Relatórios

Files in This Item:
File Description SizeFormat 
22_99_000611343.pdf187.45 kBAdobe PDFView/Open
Show simple item record Recommend this item View Statistics


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