Consensus algorithms for the generation of all maximal bicliques

DOI10.1016/j.dam.2003.09.004zbMath1056.05132OpenAlexW1980503920MaRDI QIDQ705493

Sorin Alexe, Gabriela Alexe, Bruno Simeone, Stephan Foldes, Peter L. Hammer, Yves Cramer

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

zbMATH Keywords

Algorithmic graph theoryBicliqueConsensus-type algorithmIncremental polynomial enumerationMaximal complete bipartite subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in CAN-free graphs
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• The struction of a graph: Application to CN-free graphs
• On generating all maximal independent sets
• On the coverings of graphs
• The disengagement algorithm or a new generalization of the exclusion algorithm
• Bipartite subgraphs of graphs with maximum degree three
• Arboricity and bipartite subgraph listing algorithms
• Can visibility graphs be represented compactly?
• Polynomial-time inference of all valid implications for Horn and related formulae
• The maximum edge biclique problem is NP-complete
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• On Bipartite and Multipartite Clique Problems
• A Way to Simplify Truth Functions
• Coverings of Bipartite Graphs
• Stability in circular arc graphs
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Quasimonotone Boolean Functions and Bistellar Graphs
• On the Decomposition of Graphs
• A New Algorithm for Generating All the Maximal Independent Sets
• Approximating Clique and Biclique Problems
• Node-and edge-deletion NP-complete problems
• Maximum matching in a convex bipartite graph
• The NP-completeness column: An ongoing guide