Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Add wikidata reference.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp nonasymptotic bounds on the norm of random matrices with independent entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs, partial geometries and partially balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative cones - a family of three eigenvalue graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Graph Invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing certain graphs with four eigenvalues by their spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spreads in strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with three eigenvalues / 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: ORBITOPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with four eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small regular graphs with four eigenvalues / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130122118 / rank
 
Normal rank

Latest revision as of 11:45, 16 December 2024

scientific article; zbMATH DE number 6855328
Language Label Description Also known as
English
Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation
scientific article; zbMATH DE number 6855328

    Statements

    Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (English)
    0 references
    3 April 2018
    0 references
    convex optimization
    0 references
    distance-regular graphs
    0 references
    induced subgraph isomorphism
    0 references
    majorization
    0 references
    orbitopes
    0 references
    semidefinite programming
    0 references
    strongly regular graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references