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

DOI10.1016/J.DAM.2013.01.014MaRDI QIDQ2448895zbMATHOpenAlexFDO

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

convex bipartite graphmaximal bicliquesconsecutive ones property

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 3679885 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• 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
• On Independent Sets and Bicliques in Graphs
• On computing the size of a lattice and related decision problems
• The maximum edge biclique problem is NP-complete

Cited in

(7)

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

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)