Extending [K 1 , K 2 ] Anonymization of Shortest Paths for Social Networks.
Yu-Chuan TsaiShyue-Liang WangTzung-Pei HongHung-Yu KaoPublished in: MISNC (2015)
Keyphrases
- shortest path
- social networks
- betweenness centrality
- social network analysis
- road network
- shortest path algorithm
- shortest path problem
- complex networks
- routing algorithm
- path length
- travel time
- optimal path
- finding the shortest path
- flow graph
- weighted graph
- online social networks
- minimum cost flow
- geodesic distance
- small world
- information flow
- minimal surface
- community structure
- strongly connected components
- network structure