Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (Q3439135): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum All-Ones Problem for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the lamp lighting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear cellular automata and the garden-of-eden / rank
 
Normal rank
Property / cites work
 
Property / cites work: The σ-Game and Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma\)-Automata and Chebyshev-polynomials / rank
 
Normal rank

Latest revision as of 20:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
scientific article

    Statements

    Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    (minimum) all-ones problem
    0 references
    graph-theoretic algorithm
    0 references
    linear time
    0 references
    0 references