A convexity upper bound for the number of maximal bicliques of a bipartite graph

DOI10.1016/J.DAM.2013.01.014MaRDI QIDQ2448895zbMATH OpenOpenAlexFDO

Authors Alexandre Albano, Alair Pereira do Lago

Publication date 5 May 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.01.014

zbMATH Keywords

consecutive ones propertyconvex bipartite graphmaximal bicliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Bicliques in graphs. I: Bounds on their number
• Finding maximum edge bicliques in convex bipartite graphs
• Finding maximum edge bicliques in convex bipartite graphs
• Efficient enumeration of maximal induced bicliques
• On the convexity number of graphs

Cites work

• A Linear Delay Algorithm for Building Concept Lattices
• Arboricity and bipartite subgraph listing algorithms
• Bicliques in graphs. I: Bounds on their number
• Edge-Disjoint Spanning Trees of Finite Graphs
• Exact exponential-time algorithms for finding bicliques
• Formal concept analysis. Mathematical foundations. Transl. from the German by Cornelia Franzke
• scientific article; zbMATH DE number 3679885 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mining minimal non-redundant association rules using frequent closed itemsets
• On computing the size of a lattice and related decision problems
• On Independent Sets and Bicliques in Graphs
• The maximum edge biclique problem is NP-complete

Cited in

(8)

• A convexity lemma and expansion procedures for bipartite graphs
• Finding maximum edge bicliques in convex bipartite graphs
• Biclique graphs of split graphs
• On the Galois lattice of bipartite distance hereditary graphs
• On computing the Galois lattice of bipartite distance hereditary graphs
• Finding maximum edge bicliques in convex bipartite graphs
• Maximum Edge Bicliques in Tree Convex Bipartite Graphs
• A continuous characterization of the maximum-edge biclique problem

This page was built for publication: A convexity upper bound for the number of maximal bicliques of a bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448895)