Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies.
Bart M. P. JansenJari J. H. de KroonPublished in: J. Comput. Syst. Sci. (2022)
Keyphrases
- low rank
- matrix completion
- missing data
- linear combination
- graph properties
- rank minimization
- convex optimization
- matrix factorization
- singular value decomposition
- high dimensional data
- optimization problems
- data sets
- minimization problems
- low rank matrix
- directed graph
- graph theoretic
- shortest path
- trace norm
- simulated annealing