TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector


Manguoglu M., Cox E., Saied F., Sameh A.

9th International Conference on High Performance Computing for Computational Science, California, Amerika Birleşik Devletleri, 22 - 25 Haziran 2010, cilt.6449, ss.449-450 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 6449
  • Basıldığı Şehir: California
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayıları: ss.449-450
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

The eigenvector corresponding to the second smallest eigenvalue of the Laplacian of a graph, known as the Fiedler vector, has a number of applications in areas that include matrix reordering, graph partitioning, protein analysis, data mining, machine learning, and web search. The computation of the Fiedler vector has been regarded as an expensive process as it involves solving a large eigenvalue problem. We present a novel and efficient parallel algorithm for computing the Fiedler vector of large graphs based on the Trace Minimization algorithm. We compare the parallel performance of our method with a multilevel scheme, designed specifically for computing the Fiedler vector, which is implemented in routine MC73_FIEDLER of the Harwell Subroutine Library (HSL).