Metrics
109 Record Views
Book chapter
Monte Carlo techniques for estimating the Fiedler vector in graph applications
Computational Science — ICCS 2002: International Conference Amsterdam, The Netherlands, April 21–24, 2002 Proceedings, Part II, Vol.2330(2), pp.635-645
Lecture notes in computer science, volume 2330, Springer
2002
Web of Science ID: WOS:000181351000066
Abstract
Determining the Fiedler vector of the Laplacian or adjacency matrices of graphs is the most computationally intensive component of several applications, such as graph partitioning, graph coloring, envelope reduction, and seriation. Often an approximation of the Fiedler vector is sufficient. We discuss issues involved in the use of Monte Carlo techniques for this purpose.
Related links
Details
- Title
- Monte Carlo techniques for estimating the Fiedler vector in graph applications
- Publication Details
- Computational Science — ICCS 2002: International Conference Amsterdam, The Netherlands, April 21–24, 2002 Proceedings, Part II, Vol.2330(2), pp.635-645
- Resource Type
- Book chapter
- Publisher
- Springer
- Series
- Lecture notes in computer science; volume 2330
- Copyright
- © 2002 Springer-Verlag Berlin Heidelberg
- Identifiers
- WOS:000181351000066; 99380178126706600
- Academic Unit
- Hal Marcus College of Science and Engineering ; Computer Science
- Language
- English