Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks.
Acong ZhangJincheng HuangPing LiKai ZhangPublished in: CoRR (2023)
Keyphrases
- average degree
- edge weights
- graph structure
- small world
- fully connected
- directed graph
- betweenness centrality
- graph structures
- overlapping communities
- weighted graph
- directed edges
- network structure
- complex networks
- neighboring nodes
- sparsely connected
- real world networks
- real world graphs
- heterogeneous social networks
- social networks
- random walk
- real world social networks
- path length
- network size
- scale free
- adjacency matrix
- undirected graph
- shortest path
- social graphs
- random graphs
- small world networks
- densely connected
- nodes of a graph
- network analysis
- spanning tree
- dominating set
- graph theory
- information networks
- root node
- graph mining algorithms
- social network analysis
- network topologies
- graph clustering
- bipartite graph
- bayesian networks
- connected components
- graph representation
- graph partitioning
- centrality measures
- directed acyclic graph
- graph mining
- structured data
- massive graphs
- community structure
- graph matching
- graph layout
- missing links
- biological networks
- power law
- graph data
- source node
- planar graphs
- clustering coefficient
- network nodes