28 search results - page 3 / 6 » On the extreme eigenvalues of regular graphs |
INFOVIS
2002
IEEE
14 years 8 days ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
IPCO
1993
13 years 8 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
ISPAN
2005
IEEE
14 years 28 days ago
2005
IEEE
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...