Approximating the minimum rank of a graph via alternating projection


The minimum rank problem asks to find the minimum rank over all matrices with given pattern associated with a graph. This problem is NP-hard, and there is no known approximation method. In this article, a numerical algorithm is given to heuristically approximate the minimum rank using alternating projections. The effectiveness of this algorithm is… (More)
DOI: 10.1016/j.orl.2016.02.001


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics