A Robust Advantaged Node Placement Strategy for Sparse Network Graphs.
Kai DingHomayoun Yousefi'zadehFaryar JabbariPublished in: CoRR (2018)
Keyphrases
- finding the shortest path
- densely connected
- small world networks
- fully connected
- graph structure
- directed graph
- degree distribution
- small world
- real world networks
- dynamic networks
- intermediate nodes
- centrality measures
- highly connected
- protein interaction networks
- scale free
- real time face tracking
- high dimensional
- neural network
- shortest path
- network structure
- spanning tree
- network model
- graph theory
- undirected graph
- network traffic
- strongly connected
- network nodes
- hidden nodes
- network topologies
- mobile nodes
- weighted graph
- community detection
- communication networks
- computer networks
- graph databases
- link failure
- overlapping communities
- neighboring nodes
- rank minimization
- black hole
- random graphs
- social network analysis
- network resources
- wavelength division multiplexing