[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] Eigenpairs of sparse graphs

From: David Morton
Subject: [igraph] Eigenpairs of sparse graphs
Date: Sun, 9 Mar 2008 19:57:31 +0100

I need to compute some extremal eigenvalues/eigenvectors of
adjacency and Laplacian matrices for very large and sparse graphs.
(to large for the matrices to be represented in their dense form anyway).

Given the graphs, how can I achieve this task with igraph?

David Morton de Lachapalle.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]