Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering.
Mario CoutinoSundeep Prabhakar ChepuriTakanori MaeharaGeert LeusPublished in: Algorithms (2020)
Keyphrases
- laplacian matrix
- spectral decomposition
- adjacency matrix
- spectral methods
- structured data
- graph representation
- graph theory
- graph kernels
- graph structure
- graph matching
- labeled graphs
- weighted graph
- graph structures
- graph databases
- directed graph
- graph classification
- graph model
- graph construction
- graph search
- graph theoretic
- graph clustering
- graph theoretical
- undirected graph
- subgraph isomorphism
- graph mining
- graph partitioning
- spectral clustering
- graph data
- graph laplacian
- graph transformation
- random walk
- graph properties
- gaussian convolution
- bipartite graph
- approximation algorithms
- spanning tree
- web graph
- maximum common subgraph
- spectral analysis
- random graphs
- series parallel
- graph representations
- normalized cut
- graph isomorphism
- spectral graph
- graph drawing
- reachability queries
- planar graphs
- evolving graphs
- directed acyclic
- graph patterns
- dense subgraphs
- dynamic graph
- maximal cliques
- finding the shortest path
- connected graphs
- connected dominating set
- maximum cardinality
- structural pattern recognition
- maximum clique
- query graph
- directed acyclic graph
- social networks
- community discovery