z-logo
open-access-imgOpen Access
Spectral techniques in graph algorithms
Author(s) -
Noga Alon
Publication year - 1998
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-64275-7
DOI - 10.1007/bfb0054322
Subject(s) - computer science , eigenvalues and eigenvectors , algorithm , graph , theoretical computer science , quantum mechanics , physics
The existence of ecient 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom