Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,

DOI10.1051/ro/2011112zbMath1247.05239OpenAlexW2028997713MaRDI QIDQ2907957

Marina Groshaus, Jayme Luiz Szwarcfiter

Publication date: 4 September 2012

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222500

zbMATH Keywords

algorithmshypergraphsbipartite graphsHelly propertybiclique matricesbiclique-Hellyclique matrices

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Generating bicliques of a graph in lexicographic order
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• A hierarchy of self-clique graphs
• Biclique-Helly graphs
• Algorithms on circular-arc graphs
• Biclique graphs and biclique matrices
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,