The clique problem for graphs with a few eigenvalues of the same sign (Q2355311): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-014-0805-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2052456636
@@ Property / OpenAlex ID: W2052456636 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding independent sets in a graph using continuous multivariable polynomial formulations.
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+Active constraints, indefinite quadratic test problems, and complexity
+Normal rank
@@ Property / cites work @@
+The polynomial solvability of convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q5331504
@@ Property / cites work: Q5331504 / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank