Graph Sparsification via Mixture of Graphs.
Guibin ZhangXiangguo SunYanwei YueKun WangTianlong ChenShirui PanPublished in: CoRR (2024)
Keyphrases
- graph representation
- graph theoretic
- graph theory
- weighted graph
- directed graph
- graph mining
- graph structure
- graph construction
- graph theoretical
- graph matching
- labeled graphs
- graph structures
- graph properties
- adjacency matrix
- random graphs
- graph databases
- graph partitioning
- graph model
- graph clustering
- graph classification
- subgraph isomorphism
- graph data
- graph search
- graph isomorphism
- structural pattern recognition
- undirected graph
- series parallel
- graph representations
- attributed graphs
- graph transformation
- dynamic graph
- connected dominating set
- spanning tree
- maximum cardinality
- bipartite graph
- mixture model
- maximum clique
- edge weights
- maximum common subgraph
- graph patterns
- directed acyclic
- graph kernels
- disk resident
- minimum spanning tree
- social graphs
- massive graphs
- reachability queries
- connected components
- graph embedding
- community discovery
- inexact graph matching
- maximum independent set
- vertex set
- web graph
- real world graphs
- association graph
- random walk
- topological information
- planar graphs
- proximity graph
- directed acyclic graph
- graph layout
- finding the shortest path
- frequent subgraphs
- neighborhood graph
- graphical models
- structured data
- evolving graphs
- probabilistic model
- dense subgraphs
- maximal cliques
- average degree
- query graph