The Complexity of the Positive Semidefinite Zero Forcing (Q2942442): 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: 1407.7017 / 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: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / 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: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fast Searching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional intersection number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank

Latest revision as of 17:43, 10 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of the Positive Semidefinite Zero Forcing
scientific article

    Statements

    Identifiers

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