• # LAMG

• Referenced in 22 articles [sw06551]
• Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver. Laplacian matrices of graphs arise ... presented, where $A$ is a graph Laplacian. LAMG’s run time and storage are empirically ... Laplacian systems is constructed, and an iterative solve phase using multigrid cycles. General graphs pose...
• # SyncSpecCnn

• Referenced in 3 articles [sw26163]
• spectral domain spanned by graph laplacian eigenbases. Under this setting, our network, named SyncSpecCNN, strive ... scale analysis in different parts of the graph for a single shape...
• # SpectralNET

• Referenced in 3 articles [sw26161]
• each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree ... adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear ... provides an elegant view of global graph structure (Laplacian eigenvectors). CONCLUSION: SpectralNET provides an easily...
• # NetLSD

• Referenced in 1 article [sw32341]
• large graph collections. In this paper, we propose the Network Laplacian Spectral Descriptor (NetLSD ... size-invariant, scale-adaptive, and efficiently computable graph representation method that allows for straightforward comparisons ... graphs. NetLSD extracts a compact signature that inherits the formal properties of the Laplacian spectrum ... thus, it hears the shape of a graph. Our evaluation on a variety of real...
• # PQSER

• Referenced in 2 articles [sw22074]
• whose interrelationship is defined by a bipartite graph. It has important applications in, e.g., archaeology ... Fiedler vector of the Laplacian matrix associated to the problem, which encodes...