Sciweavers

315 search results - page 1 / 63
» Eigenvalue bounds for independent sets
Sort
View
JCT
2008
50views more  JCT 2008»
13 years 4 months ago
Eigenvalue bounds for independent sets
Chris D. Godsil, M. W. Newman
JCT
2007
146views more  JCT 2007»
13 years 4 months ago
Laplacian spectral bounds for clique and independence numbers of graphs
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
Mei Lu, Huiqing Liu, Feng Tian
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 8 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
MOC
1998
106views more  MOC 1998»
13 years 4 months ago
Bounds for eigenvalues and condition numbers in the p-version of the finite element method
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...
Ning Hu, Xian-Zhong Guo, I. Norman Katz
JUCS
2007
99views more  JUCS 2007»
13 years 4 months ago
Spectral Densest Subgraph and Independence Number of a Graph
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
Reid Andersen, Sebastian M. Cioaba