On independent sets and bicliques in graphs (Q2428684): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3044360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus algorithms for the generation of all maximal bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting models for 2SAT and 3SAT formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bipartite and Multipartite Clique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating bicliques of a graph in lexicographic order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of bicliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Counting 2-Sat Solutions and Colorings with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Sets and Bicliques in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Clique and Biclique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fine-grained Analysis of a Simple Independent Set Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for building lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast incremental algorithm for building lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of independent sets in chordal graphs / 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: Bicliques in graphs. I: Bounds on their number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 02:37, 5 July 2024

scientific article
Language Label Description Also known as
English
On independent sets and bicliques in graphs
scientific article

    Statements

    On independent sets and bicliques in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    counting algorithms
    0 references
    combinatorial bound
    0 references
    maximal bicliques
    0 references
    maximal independent sets
    0 references
    exact exponential time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references