Algorithm Design Using Spectral Graph Theory
Spectral graph theory is the interplay between linear algebra and combinatorial graph theory. Laplace’s equation and its discrete form, the Laplacian matrix, appear ubiquitously in mathematical physics. Due to the recent discovery of very fast solvers for these equations, they are also becoming incr...
Main Author: | Peng, Richard |
---|---|
Format: | Others |
Published: |
Research Showcase @ CMU
2013
|
Subjects: | |
Online Access: | http://repository.cmu.edu/dissertations/277 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1279&context=dissertations |
Similar Items
-
Editorial for the Special Issue on “Algorithms for Graphs and Networks”
by: Rhyd Lewis
Published: (2020-11-01) -
Guided graph spectral embedding: Application to the C. elegans connectome
by: Miljan Petrovic, et al.
Published: (2019-07-01) -
Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations
by: Chavez, Gustavo Ivan
Published: (2017) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
Incremental Graph Embedding Based on Spatial-Spectral Neighbors for Hyperspectral Image Classification
by: Dongqing Li, et al.
Published: (2018-01-01)