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

DOI10.1016/j.dam.2013.01.014zbMath1288.05131OpenAlexW2055265744MaRDI QIDQ2448895

Alair Pereira do Lago, Alexandre Albano

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

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

Related Items (3)

On computing the Galois lattice of bipartite distance hereditary graphs ⋮ Biclique graphs of split graphs ⋮ On the Galois lattice of bipartite distance hereditary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arboricity and bipartite subgraph listing algorithms
• The maximum edge biclique problem is NP-complete
• Exact exponential-time algorithms for finding bicliques
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Linear Delay Algorithm for Building Concept Lattices
• On Independent Sets and Bicliques in Graphs
• Bicliques in graphs. I: Bounds on their number
• On computing the size of a lattice and related decision problems

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