On the complexity of failed zero forcing (Q729899): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1609.00211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failed skew zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the positive semidefinite zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Semidefinite Zero Forcing: Complexity and Lower Bounds / rank
 
Normal rank

Latest revision as of 04:40, 13 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of failed zero forcing
scientific article

    Statements

    Identifiers

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