Sciweavers

Share
ORL
2016

Approximating the minimum rank of a graph via alternating projection

1 years 6 months ago
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 demonstrated by comparing its results to a related parameter: the zero-forcing number. Using these methods, numerical evidence for the minimum rank graph complement conjecture is provided.
Franklin H. J. Kenter
Added 08 Apr 2016
Updated 08 Apr 2016
Type Journal
Year 2016
Where ORL
Authors Franklin H. J. Kenter
Comments (0)
books