Skip to main content
Share Your Experience: Take the 2024 Developer Survey
Dimitris's user avatar
Dimitris's user avatar
Dimitris's user avatar
Dimitris
  • Member for 12 years, 7 months
  • Last seen more than 8 years ago
11 votes
0 answers
2k views

Complexity of finding the leading eigenvector of a graph Laplacian

8 votes
3 answers
987 views

Hardness of MAX-CUT on sparse graphs

9 votes
1 answer
579 views

Applications of Spectral Graph Theory in Information and Coding Theory

7 votes
0 answers
556 views

Which problems in graph theory can be stated as quadratic programs?

11 votes
1 answer
476 views

Constructing vectors in general position

4 votes
0 answers
466 views

The largest connected component of a random subgraph

7 votes
1 answer
382 views

Complexity to calculate a full set of eigenvectors over a finite field

8 votes
1 answer
368 views

Bounds on the smaller eigenvalues of the adjacency matrix of a graph

14 votes
1 answer
334 views

Cases of nearly linear time solvable linear systems

13 votes
0 answers
197 views

Complexity to compute the eigenvalue signs of the adjacency matrix

10 votes
0 answers
170 views

Number of graphs with prescribed spectrum