Pages that link to "Item:Q705493"

The following pages link to Consensus algorithms for the generation of all maximal bicliques (Q705493):

Displaying 34 items.

• Bicolored independent sets and bicliques (Q436317) (← links)
• On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
• The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
• Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
• Generating bicliques of a graph in lexicographic order (Q557825) (← links)
• Edge cover by connected bipartite subgraphs (Q646717) (← links)
• A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
• An approximation ratio for biclustering (Q975394) (← links)
• Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
• Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
• Special issue: Boolean functions and related problems (Q1841878) (← links)
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions (Q1841879) (← links)
• Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
• Finding and enumerating large intersections (Q2344773) (← links)
• On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
• Chromatic characterization of biclique covers (Q2368922) (← links)
• Logical analysis of data -- the vision of Peter L. Hammer (Q2385443) (← links)
• On independent sets and bicliques in graphs (Q2428684) (← links)
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences (Q2446577) (← links)
• Comprehensive vs. comprehensible classifiers in logical analysis of data (Q2478431) (← links)
• Spanned patterns for the logical analysis of data (Q2489650) (← links)
• Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
• Detecting composite functional module in miRNA regulation and mRNA interaction network (Q2633222) (← links)
• Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
• (Q4691855) (← links)
• Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks (Q4969697) (← links)
• On Problem of Finding all Maximal Induced Bicliques of Hypergraph (Q5071398) (← links)
• Biclique graphs and biclique matrices (Q5189236) (← links)
• Simple Undirected Graphs as Formal Contexts (Q5255665) (← links)
• On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
• Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720) (← links)
• On the generation of bicliques of a graph (Q5899361) (← links)
• On the generation of bicliques of a graph (Q5919931) (← links)
• Systematic categorization and evaluation of CbO-based algorithms in FCA (Q6065995) (← links)