Clique-inverse graphs of bipartite graphs

dc.creatorProtti, Fábio
dc.creatorSzwarcfiter, Jayme Luiz
dc.date2017-08-18T14:17:08Z
dc.date2023-09-27T03:01:19Z
dc.date2004-12-31
dc.date.accessioned2023-09-27T13:10:00Z
dc.date.available2023-09-27T13:10:00Z
dc.identifierPROTTI, F; SZWARCFITER, J. L. Clique-inverse graphs of bipartite graphs. Rio de Janeiro: NCE, UFRJ, 1999. 13 p. (Relatório Técnico, 22/99)
dc.identifierhttp://hdl.handle.net/11422/2717
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8902322
dc.descriptionThe 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.
dc.languageeng
dc.publisherBrasil
dc.publisherInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
dc.relationRelatório Técnico NCE
dc.rightsAcesso Aberto
dc.subjectInterseção de grafos
dc.subjectGrafos clique-inverse
dc.subjectGrafos clique
dc.subjectIntersection graphs
dc.subjectClique graphs
dc.subjectClique-inverse graphs
dc.subjectCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO
dc.titleClique-inverse graphs of bipartite graphs
dc.typeRelatório


Este ítem pertenece a la siguiente institución