Consensus algorithms for the generation of all maximal bicliques
From MaRDI portal
Publication:705493
DOI10.1016/J.DAM.2003.09.004zbMATH Open1056.05132OpenAlexW1980503920MaRDI QIDQ705493FDOQ705493
Authors: Gabriela Alexe, Sorin Alexe, Stephan Foldes, Peter L. Hammer, Bruno Simeone, Yves Crama 
Publication date: 31 January 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://orbi.ulg.ac.be/handle/2268/1729
Recommendations
Algorithmic graph theoryBicliqueConsensus-type algorithmIncremental polynomial enumerationMaximal complete bipartite subgraph
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Polynomial-time inference of all valid implications for Horn and related formulae
- A Way to Simplify Truth Functions
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- Title not available (Why is that?)
- On the Decomposition of Graphs
- Node-and edge-deletion NP-complete problems
- Can visibility graphs be represented compactly?
- Title not available (Why is that?)
- Title not available (Why is that?)
- On generating all maximal independent sets
- Coverings of Bipartite Graphs
- Maximum matching in a convex bipartite graph
- On bipartite and multipartite clique problems
- Stability in circular arc graphs
- Title not available (Why is that?)
- The maximum edge biclique problem is NP-complete
- On the coverings of graphs
- Title not available (Why is that?)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Approximating Clique and Biclique Problems
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions
- Title not available (Why is that?)
- The struction of a graph: Application to CN-free graphs
- Title not available (Why is that?)
- The NP-completeness column: An ongoing guide
- Stability in CAN-free graphs
- Arboricity and bipartite subgraph listing algorithms
- Title not available (Why is that?)
- Quasimonotone Boolean Functions and Bistellar Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The disengagement algorithm or a new generalization of the exclusion algorithm
- Bipartite subgraphs of graphs with maximum degree three
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (36)
- Spanned patterns for the logical analysis of data
- On Independent Sets and Bicliques in Graphs
- Title not available (Why is that?)
- Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks
- Chromatic characterization of biclique covers
- Detecting composite functional module in miRNA regulation and mRNA interaction network
- 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
- An approximation ratio for biclustering
- Scale reduction techniques for computing maximum induced bicliques
- Logical analysis of data -- the vision of Peter L. Hammer
- On the generation of bicliques of a graph
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Biclique graphs and biclique matrices
- Prominent classes of the most general subsumptive solutions of Boolean equations
- Systematic categorization and evaluation of CbO-based algorithms in FCA
- On the generation of bicliques of a graph
- A continuous characterization of the maximum-edge biclique problem
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions
- Finding maximum edge bicliques in convex bipartite graphs
- On the termination of some biclique operators on multipartite graphs
- Efficient enumeration of maximal induced bicliques
- On computing the Galois lattice of bipartite distance hereditary graphs
- Simple Undirected Graphs as Formal Contexts
- Finding and enumerating large intersections
- Enumeration aspects of maximal cliques and bicliques
- The joy of implications, aka pure Horn formulas: mainly a survey
- Edge cover by connected bipartite subgraphs
- Formal Concept Analysis
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- On Problem of Finding all Maximal Induced Bicliques of Hypergraph
- Special issue: Boolean functions and related problems
- On independent sets and bicliques in graphs
This page was built for publication: Consensus algorithms for the generation of all maximal bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705493)
