Consensus algorithms for the generation of all maximal bicliques

DOI10.1016/J.DAM.2003.09.004MaRDI QIDQ705493zbMATHOpenAlexFDO

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

zbMATH Keywords

Algorithmic graph theoryBicliqueConsensus-type algorithmIncremental polynomial enumerationMaximal complete bipartite subgraph

Mathematics Subject Classification ID

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

Recommendations

• Algorithm Theory - SWAT 2004
• Efficient enumeration of maximal induced bicliques
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
• Generating bicliques of a graph in lexicographic order
• Linear-time algorithm for generating c-isolated bicliques

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3841905 (Why is no real title available?)
• scientific article; zbMATH DE number 3853102 (Why is no real title available?)
• scientific article; zbMATH DE number 3904619 (Why is no real title available?)
• scientific article; zbMATH DE number 3713491 (Why is no real title available?)
• scientific article; zbMATH DE number 15496 (Why is no real title available?)
• scientific article; zbMATH DE number 3561387 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 1439493 (Why is no real title available?)
• scientific article; zbMATH DE number 3313254 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• scientific article; zbMATH DE number 3029852 (Why is no real title available?)
• A New Algorithm for Generating All the Maximal Independent Sets
• A Way to Simplify Truth Functions
• Approximating Clique and Biclique Problems
• Arboricity and bipartite subgraph listing algorithms
• Bipartite subgraphs of graphs with maximum degree three
• Can visibility graphs be represented compactly?
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Coverings of Bipartite Graphs
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Maximum matching in a convex bipartite graph
• Node-and edge-deletion NP-complete problems
• On bipartite and multipartite clique problems
• On generating all maximal independent sets
• On the Decomposition of Graphs
• On the coverings of graphs
• Polynomial-time inference of all valid implications for Horn and related formulae
• Quasimonotone Boolean Functions and Bistellar Graphs
• Stability in CAN-free graphs
• Stability in circular arc graphs
• The NP-completeness column: An ongoing guide
• The disengagement algorithm or a new generalization of the exclusion algorithm
• The maximum edge biclique problem is NP-complete
• The struction of a graph: Application to CN-free graphs

Cited in

(37)

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

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)