Consensus algorithms for the generation of all maximal bicliques (Q705493): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1278721
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yves Cramer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980503920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can visibility graphs be represented compactly? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3904382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5769706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs of graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bipartite and Multipartite Clique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and bipartite subgraph listing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive and conjunctive normal forms of pseudo-Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The struction of a graph: Application to CN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in CAN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasimonotone Boolean Functions and Bistellar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Clique and Biclique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum edge biclique problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disengagement algorithm or a new generalization of the exclusion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 16:49, 7 June 2024

scientific article
Language Label Description Also known as
English
Consensus algorithms for the generation of all maximal bicliques
scientific article

    Statements

    Consensus algorithms for the generation of all maximal bicliques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 January 2005
    0 references
    Maximal complete bipartite subgraph
    0 references
    Biclique
    0 references
    Consensus-type algorithm
    0 references
    Algorithmic graph theory
    0 references
    Incremental polynomial enumeration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers