Shortest path tree sampling for landmark selection in large networks

Keyphrases

• Counting Shortest Paths 20%
• Distance between Vertices 20%
• Distance Estimation 60%
• Dynamic Change 20%
• Dynamic Networks 20%
• Estimation Error 40%
• Further Analysis 20%
• Landmark Selection 100%
• Landmark-based 20%
• Large-scale Dynamics 20%
• Large-scale Networks 100%
• Network Size 20%
• Online Query 20%
• Popular 20%
• Rapid Response 20%
• Real-time Computing 20%
• Shortest-path Tree 100%
• Strong Correlation 20%
• Time Application 20%
• Tree-based Methods 20%
• Vertex Cover 20%

Computer Science

• Dynamic Network 20%
• Estimation Error 40%
• Real Time Computation 20%
• Real-Time Application 20%
• Shortest Path Tree 100%
• Space Complexity 20%
• Time Complexity 20%