Stable and Informative Spectral Signatures for Graph Matching Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University

First Page		Document Content
Date: 2014-04-22 01:44:54 Graph operations Algebraic graph theory Graph theory Line graph Matching Graph Bipartite graph Laplacian matrix Spectral graph theory Hypergraph Bipartite double cover Book:Graph Theory I		Stable and Informative Spectral Signatures for Graph Matching Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University Add to Reading List Source URL: geometry.stanford.edu Download Document from Source Website File Size: 1,17 MB Share Document on Facebook

	Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory Luca Trevisan University of California, Berkeley DocID: 1t8rW - View Document
	Spectral Graph Theory and its Applications Lecture 10 Expander Codes Lecturer: Daniel A. Spielman DocID: 1sypf - View Document
	Spectral Graph Theory Lecture 15 Properties of Expander Graphs Daniel A. Spielman DocID: 1sweE - View Document
	Spectral Graph Theory Lecture 20 Eigenvalues of Random Graphs Daniel A. Spielman DocID: 1sw1i - View Document
	Spectral Graph Theory and Applications WSBackground Knowledge of the Course Lecturer: Thomas Sauerwald & He Sun DocID: 1st9J - View Document