On the generation of bicliques of a graph
From MaRDI portal
Publication:5919931
DOI10.1016/J.DAM.2007.03.017zbMATH Open1126.05074OpenAlexW2033462054MaRDI QIDQ5919931FDOQ5919931
Authors: Vânia M. F. Dias, Celina M. H. de Figueiredo, Jayme L. Szwarcfiter 
Publication date: 19 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.017
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Node-and edge-deletion NP-complete problems
- Perfect Elimination and Chordal Bipartite Graphs
- On bipartite and multipartite clique problems
- The maximum edge biclique problem is NP-complete
- Algorithm Theory - SWAT 2004
- Absolute reflexive retracts and absolute bipartite retracts
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Bicliques in graphs. I: Bounds on their number
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Approximating Clique and Biclique Problems
- Consensus algorithms for the generation of all maximal bicliques
- Title not available (Why is that?)
- Arboricity and bipartite subgraph listing algorithms
Cited In (21)
- On Independent Sets and Bicliques in Graphs
- Linear-time algorithm for generating c-isolated bicliques
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs
- Bicolored independent sets and bicliques
- Title not available (Why is that?)
- Generating bicliques of a graph in lexicographic order
- On the Iterated Biclique Operator
- Almost every graph is divergent under the biclique operator
- Finding maximum edge bicliques in convex bipartite graphs
- Generating near‐bipartite bricks
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Efficient enumeration of maximal induced bicliques
- On bicliques and the second clique graph of suspensions
- Finding and enumerating large intersections
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
- Generating fixed density bracelets of arbitrary base
- On co-bicliques
- On independent sets and bicliques in graphs
This page was built for publication: On the generation of bicliques of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919931)
