Spectral techniques in graph algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

40 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLATIN 1998
Subtitle of host publicationTheoretical Informatics - 3rd Latin American Symposium, Proceedings
EditorsCláudio L. Lucchesi, Arnaldo V. Moura
PublisherSpringer Verlag
Pages206-215
Number of pages10
ISBN (Print)3540642757, 9783540642756
DOIs
StatePublished - 1998
Event3rd Latin American Symposium on Theoretical Informatics, LATIN 1998 - Campinas, Brazil
Duration: Apr 20 1998Apr 24 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1380
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Latin American Symposium on Theoretical Informatics, LATIN 1998
CountryBrazil
CityCampinas
Period4/20/984/24/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Spectral techniques in graph algorithms'. Together they form a unique fingerprint.

  • Cite this

    Alon, N. (1998). Spectral techniques in graph algorithms. In C. L. Lucchesi, & A. V. Moura (Eds.), LATIN 1998: Theoretical Informatics - 3rd Latin American Symposium, Proceedings (pp. 206-215). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1380). Springer Verlag. https://doi.org/10.1007/bfb0054322