FHA: Fast Heuristic Attack Against Graph Convolutional Networks.
Haoxi ZhanXiaobing PeiPublished in: DS (2021)
Keyphrases
- dynamic programming
- average degree
- random walk
- attack graph
- complex networks
- fully connected
- network analysis
- graph theory
- community discovery
- minimum spanning tree
- maximum independent set
- social networks
- dynamic networks
- search algorithm
- graph model
- optimal solution
- depth first search
- graph search
- countermeasures
- graph structure
- computer networks
- overlapping communities
- directed edges
- path length
- secret key
- edge weights
- graph theoretic
- graph representation
- tabu search
- network structure
- connected components
- structured data
- small world
- heuristic search
- social graphs
- betweenness centrality
- degree distribution
- breadth first search
- bipartite graph
- weighted graph
- graph databases
- network topologies
- graph structures
- random graphs