Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach.
Wendong BiLun DuQiang FuYanlin WangShi HanDongmei ZhangPublished in: CoRR (2022)
Keyphrases
- graph representation
- graph theory
- labeled graphs
- graph matching
- graph databases
- graph structure
- graph model
- graph construction
- adjacency matrix
- directed graph
- weighted graph
- graph mining
- graph theoretic
- graph classification
- graph structures
- graph properties
- graph theoretical
- graph search
- structural pattern recognition
- graph partitioning
- graph clustering
- real world graphs
- graph data
- subgraph isomorphism
- graph kernels
- series parallel
- graph transformation
- random graphs
- dynamic graph
- bipartite graph
- disk resident
- small world
- undirected graph
- spanning tree
- graph isomorphism
- reachability queries
- maximum common subgraph
- evolving graphs
- graph layout
- inexact graph matching
- graph representations
- minimum spanning tree
- proximity graph
- web graph
- connected graphs
- connected components
- scale free
- planar graphs
- polynomial time complexity
- directed acyclic
- edge weights
- spectral decomposition
- community discovery
- maximum independent set
- connected dominating set
- maximum clique
- graph embedding
- graph patterns
- query graph
- attributed graphs
- random walk
- topological information
- structured data
- directed acyclic graph
- finding the shortest path
- neighborhood graph
- np complete
- hyper graph
- link prediction
- biological networks
- maximum cardinality
- massive graphs
- power law
- dense subgraphs
- fully connected
- social networks
- maximal cliques
- bounded treewidth
- average degree
- social graphs