- Graph laplacian
- adjacency matrix W
- incident matrix C with source node +1 and sink node -1
- Graph laplacian = C_trans*C = D - W
- example: 1-dimensional string fling
- Algebraic pre-requisites
- Graph partitioning problem
- Formulation of the optimization
- Graph convolutional networks for geometric deep learning
- Geometric-deep-learning
- Other references:
Oct 31, 2019
Graph Spectral Partitioning
Subscribe to:
Post Comments (Atom)
-
To install pngwrite we need to install to helper library before we install pngwriter. 1. libpng 2. freetype2 We can use fink or macport to i...
-
Parsing and displaying dates and times is often complicated because of formatting and locale issues. Java 2 Platform, Standard Edition (J2S...
No comments:
Post a Comment