A convexity upper bound for the number of maximal bicliques of a bipartite graph
DOI10.1016/J.DAM.2013.01.014zbMATH Open1288.05131OpenAlexW2055265744MaRDI QIDQ2448895FDOQ2448895
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-Disjoint Spanning Trees of Finite Graphs
- The maximum edge biclique problem is NP-complete
- Title not available (Why is that?)
- 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
- Exact exponential-time algorithms for finding bicliques
- Arboricity and bipartite subgraph listing algorithms
- Title not available (Why is that?)
- A Linear Delay Algorithm for Building Concept Lattices
Cited In (7)
- Finding maximum edge bicliques in convex bipartite graphs
- On the Galois lattice of bipartite distance hereditary graphs
- A continuous characterization of the maximum-edge biclique problem
- Finding maximum edge bicliques in convex bipartite graphs
- On computing the Galois lattice of bipartite distance hereditary graphs
- Biclique graphs of split graphs
- A convexity lemma and expansion procedures for bipartite 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)
