Generating bicliques of a graph in lexicographic order
DOI10.1016/J.TCS.2005.01.014zbMATH Open1076.68048OpenAlexW1979312971MaRDI QIDQ557825FDOQ557825
Authors: Vânia M. F. Dias, Celina M. H. de Figueiredo, Jayme L. Szwarcfiter 
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.014
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- On edge perfectness and classes of bipartite graphs
- Node-and edge-deletion NP-complete problems
- On generating all maximal independent sets
- Perfect Elimination and Chordal Bipartite Graphs
- On bipartite and multipartite clique problems
- The maximum edge biclique problem is NP-complete
- Absolute reflexive retracts and absolute bipartite retracts
- 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?)
Cited In (21)
- On the iterated biclique operator
- On Independent Sets and Bicliques in Graphs
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs
- Bicolored independent sets and bicliques
- Consensus algorithms for the generation of all maximal bicliques
- On the generation of bicliques of a graph
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Biclique graphs and biclique matrices
- Exact exponential-time algorithms for finding bicliques
- Almost every graph is divergent under the biclique operator
- Problems and invariants connected with bicliques and multicliques of graphs
- Finding maximum edge bicliques in convex bipartite graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Efficient enumeration of maximal induced bicliques
- Decompositional approach to research of formal contexts
- Enumeration aspects of maximal cliques and bicliques
- Formal Concept Analysis
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- On maximal chain subgraphs and covers of bipartite graphs
- On independent sets and bicliques in graphs
This page was built for publication: Generating bicliques of a graph in lexicographic order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557825)
