A shortest path approximation algorithm for complex network analysis

DOI10.3724/SP.J.1001.2011.03924MaRDI QIDQ2917146zbMATH OpenOpenAlexFDO

Authors Jintao Tang, Ji Wang, Ting Wang

Publication date 5 October 2012

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2011.03924

zbMATH Keywords

approximation algorithmnetwork propertyshortest path problemsocial networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Social networks; opinion dynamics (91D30)

Recommendations

• Approximating Betweenness Centrality
• A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network
• A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space
• Finding community structure in networks using a shortest-path-based k-means algorithm
• A novel linear algorithm for shortest paths in networks

Cited in

(8)

• A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network
• Computing source-to-target shortest paths for complex networks in RDBMS
• SHADE algorithm dynamic analyzed through complex network
• A novel linear algorithm for shortest paths in networks
• A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space
• Network-Tree Model and Shortest Path Algorithm
• Improvement of path analysis algorithm in social networks based on HBase
• Social network path analysis based on HBase

This page was built for publication: A shortest path approximation algorithm for complex network analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917146)