Maximum number of fixed points in AND-OR-NOT networks (Q2453540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum number of fixed points in regulatory Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points and maximal independent sets in AND-OR networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for independent set enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound for the number of stable sets in graphs with given number of cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of nodes in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of fixed points in Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank

Latest revision as of 15:08, 8 July 2024

scientific article
Language Label Description Also known as
English
Maximum number of fixed points in AND-OR-NOT networks
scientific article

    Statements

    Maximum number of fixed points in AND-OR-NOT networks (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2014
    0 references
    Boolean network
    0 references
    AND-OR-NOT network
    0 references
    fixed point
    0 references
    maximal independent set
    0 references

    Identifiers