A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network

Lin, C. H. (2007). A Squeeze Response Surface Methodology to Construct Approximate Reliability Function of Complex Networks [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-1411200715154597
Shih, W. C. (2021). A Near-Optimal Resource Orchestration Algorithm Based on Admission Control in Software-Defined Networks [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU202104084
Zito, J., Memelli, H., Horn, K. G., Solomon, I. C., & Wittie, L. D. (2012). Application of a ＂Staggered Walk＂ Algorithm for Generating Large-Scale Morphological Neuronal Networks. Computational Intelligence and Neuroscience, 2012(), 338-345. https://doi.org/10.1155/2012/876357
李慧文 (2014). A New Universal Generating Function Method to Search for all Minimal Paths Generate in Networks [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2912201413520433
徐偉軒（2014）。A new algorithm for dynamic shortest path problem in large network〔碩士論文，國立臺中科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0061-2008201413413400