Covering graphs with few complete bipartite subgraphs (Q1019181): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic characterization of biclique covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite dimensions and bipartite degrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of list coloring problems with a fixed total number of colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge perfectness and classes of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical analysis of human leukocyte antigen serology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952147 / rank
 
Normal rank

Revision as of 14:02, 1 July 2024

scientific article
Language Label Description Also known as
English
Covering graphs with few complete bipartite subgraphs
scientific article

    Statements

    Covering graphs with few complete bipartite subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2009
    0 references
    bicliques
    0 references
    parameterized complexity
    0 references
    covering and partitioning problems
    0 references

    Identifiers