Skip to main content
Conference Proceedings

Spectral techniques in graph algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1380 206-215
DOI: 10.1007/bfb0054322
47Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Alon, N. (1998). Spectral techniques in graph algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1380, pp. 206–215). Springer Verlag. https://doi.org/10.1007/bfb0054322

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free