Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs

Autores
Groshaus, Marina Esther; Szwarcfiter, Jayme Luis
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the same way as conformal hypergraphs and Helly hypergraphs are dual concepts, bipartite-conformal and bipartite-Helly hypergraphs are also dual. They are useful for characterizing biclique matrices and biclique graphs, that is, the incident biclique-vertex incidence matrix and the intersection graphs of the maximal bicliques of a graph, respectively. These concepts play a similar role for the bicliques of a graph, as do clique matrices and clique graphs, for the cliques of the graph. We describe polynomial time algorithms for recognizing bipartite-conformal and bipartite-Helly hypergraphs as well as biclique matrices.
Fil: Groshaus, Marina Esther. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme Luis. Universidade Federal do Rio de Janeiro; Brasil
Materia
Algorithms
Biclique Matrices
Biclique-Helly
Bipartite Graphs
Clique Matrices
Helly Property
Hypergraphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/68376
Acceder
id CONICETDig_9f3a93032a351a9fc0568b785f1c9c08
oai_identifier_str oai:ri.conicet.gov.ar:11336/68376
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphsGroshaus, Marina EstherSzwarcfiter, Jayme LuisAlgorithmsBiclique MatricesBiclique-HellyBipartite GraphsClique MatricesHelly PropertyHypergraphshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the same way as conformal hypergraphs and Helly hypergraphs are dual concepts, bipartite-conformal and bipartite-Helly hypergraphs are also dual. They are useful for characterizing biclique matrices and biclique graphs, that is, the incident biclique-vertex incidence matrix and the intersection graphs of the maximal bicliques of a graph, respectively. These concepts play a similar role for the bicliques of a graph, as do clique matrices and clique graphs, for the cliques of the graph. We describe polynomial time algorithms for recognizing bipartite-conformal and bipartite-Helly hypergraphs as well as biclique matrices.Fil: Groshaus, Marina Esther. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Szwarcfiter, Jayme Luis. Universidade Federal do Rio de Janeiro; BrasilEDP Sciences2011-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/68376Groshaus, Marina Esther; Szwarcfiter, Jayme Luis; Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs; EDP Sciences; Rairo - Recherche Operationnelle (operations Research); 45; 3; 7-2011; 209-2220399-0559CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1051/ro/2011112info:eu-repo/semantics/altIdentifier/url/https://www.rairo-ro.org/articles/ro/abs/2011/03/ro110013/ro110013.htmlinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-10T13:23:54Zoai:ri.conicet.gov.ar:11336/68376instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-10 13:23:55.207CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
title Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
spellingShingle Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
Groshaus, Marina Esther
Algorithms
Biclique Matrices
Biclique-Helly
Bipartite Graphs
Clique Matrices
Helly Property
Hypergraphs
title_short Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
title_full Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
title_fullStr Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
title_full_unstemmed Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
title_sort Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
dc.creator.none.fl_str_mv Groshaus, Marina Esther
Szwarcfiter, Jayme Luis
author Groshaus, Marina Esther
author_facet Groshaus, Marina Esther
Szwarcfiter, Jayme Luis
author_role author
author2 Szwarcfiter, Jayme Luis
author2_role author
dc.subject.none.fl_str_mv Algorithms
Biclique Matrices
Biclique-Helly
Bipartite Graphs
Clique Matrices
Helly Property
Hypergraphs
topic Algorithms
Biclique Matrices
Biclique-Helly
Bipartite Graphs
Clique Matrices
Helly Property
Hypergraphs
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the same way as conformal hypergraphs and Helly hypergraphs are dual concepts, bipartite-conformal and bipartite-Helly hypergraphs are also dual. They are useful for characterizing biclique matrices and biclique graphs, that is, the incident biclique-vertex incidence matrix and the intersection graphs of the maximal bicliques of a graph, respectively. These concepts play a similar role for the bicliques of a graph, as do clique matrices and clique graphs, for the cliques of the graph. We describe polynomial time algorithms for recognizing bipartite-conformal and bipartite-Helly hypergraphs as well as biclique matrices.
Fil: Groshaus, Marina Esther. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme Luis. Universidade Federal do Rio de Janeiro; Brasil
description A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the same way as conformal hypergraphs and Helly hypergraphs are dual concepts, bipartite-conformal and bipartite-Helly hypergraphs are also dual. They are useful for characterizing biclique matrices and biclique graphs, that is, the incident biclique-vertex incidence matrix and the intersection graphs of the maximal bicliques of a graph, respectively. These concepts play a similar role for the bicliques of a graph, as do clique matrices and clique graphs, for the cliques of the graph. We describe polynomial time algorithms for recognizing bipartite-conformal and bipartite-Helly hypergraphs as well as biclique matrices.
publishDate 2011
dc.date.none.fl_str_mv 2011-07
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/68376
Groshaus, Marina Esther; Szwarcfiter, Jayme Luis; Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs; EDP Sciences; Rairo - Recherche Operationnelle (operations Research); 45; 3; 7-2011; 209-222
0399-0559
CONICET Digital
CONICET
url http://hdl.handle.net/11336/68376
identifier_str_mv Groshaus, Marina Esther; Szwarcfiter, Jayme Luis; Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs; EDP Sciences; Rairo - Recherche Operationnelle (operations Research); 45; 3; 7-2011; 209-222
0399-0559
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1051/ro/2011112
info:eu-repo/semantics/altIdentifier/url/https://www.rairo-ro.org/articles/ro/abs/2011/03/ro110013/ro110013.html
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv EDP Sciences
publisher.none.fl_str_mv EDP Sciences
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842981323585617920
score 12.48226

Publicaciones similares