Approximating the minimum rank of a graph via alternating projection (Q1785758): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2016.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2262040526 / 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: Minimum rank, maximum nullity and zero forcing number for selected graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the graph complement conjecture for minimum rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of minimal rank and path cover number for certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of von Neumann's alternating projection algorithm for two sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Singular Value Thresholding Algorithm for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to layered space-time coding and signal processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected values of parameters associated with the minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projections on Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondiscriminatory propagation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time block codes from orthogonal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rings of operators. Reduction theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 18:01, 16 July 2024

scientific article
Language Label Description Also known as
English
Approximating the minimum rank of a graph via alternating projection
scientific article

    Statements

    Approximating the minimum rank of a graph via alternating projection (English)
    0 references
    1 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum rank of a graph
    0 references
    alternating projections
    0 references
    heuristics
    0 references
    zero-forcing
    0 references
    0 references
    0 references
    0 references