Spectral Techniques in Graph Algorithms

The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we describe several algorithms based on spectral techniques focusing on their performance for randomly generated input graphs.

• Type: Conference
• Year: 1998
• Where: LATIN
• Authors: Noga Alon
• Keywords: Efficient Algorithms, Information Management, Input Graphs, LATIN 1998, Various Graph Algorithms