Experiments with graph convolutional networks for solving the vertex p-center problem.
Elisabeth GaarMarkus SinnlPublished in: CoRR (2021)
Keyphrases
- average degree
- edge weights
- betweenness centrality
- directed graph
- undirected graph
- complex networks
- hamiltonian cycle
- random walk
- phase transition
- social networks
- fully connected
- network size
- community discovery
- weighted graph
- bipartite graph
- labeled graphs
- minimum weight
- graph theory
- vertex set
- dynamic networks
- real world networks
- social graphs
- small world
- graph representation
- graph structure
- network analysis
- power law
- combinatorial optimization
- connected components
- network structure
- graph matching
- degree distribution
- attributed graphs
- graph mining
- spanning tree
- highly connected
- graph layout
- graph structures
- structured data
- connected subgraphs
- maximum cardinality
- overlapping communities
- directed acyclic graph
- graph partitioning
- functional modules
- scale free
- minimum spanning tree