On the error of \textit{a priori} sampling: zero forcing sets and propagation time (Q2002553): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Minimum Rank / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962762906 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.08740 / 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: The PMU Placement Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throttling positive semidefinite zero forcing propagation time on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondiscriminatory propagation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite propagation time / rank
 
Normal rank

Latest revision as of 22:02, 19 July 2024

scientific article
Language Label Description Also known as
English
On the error of \textit{a priori} sampling: zero forcing sets and propagation time
scientific article

    Statements

    On the error of \textit{a priori} sampling: zero forcing sets and propagation time (English)
    0 references
    0 references
    0 references
    12 July 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum rank problem
    0 references
    zero forcing
    0 references
    propagation time
    0 references
    error polynomial vector
    0 references
    variance polynomial vector
    0 references
    0 references
    0 references
    0 references
    0 references