Performance analysis and comparison of algorithms for measures of network connectivity

MaRDI QIDQ4901710zbMATH OpenFDO

Authors Zhi-Qiang Wang, Xiaojun Sun, Sanyang Liu

Publication date 24 January 2013

zbMATH Keywords

influence vectormaximum flow methodnetwork connectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• On computing the connectivities of graphs and digraphs
• A new method for the performance index of a communication network
• scientific article; zbMATH DE number 3968289
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• Connectivity algorithms

Cited in

(6)

• Network differential connectivity analysis
• Connectivity Measures for Internet Topologies on the Level of Autonomous Systems
• An Improved Strong Connectivity Discriminant Algorithm for Complex Directed Networks
• Connection Scan Algorithm
• MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS
• An efficient algorithm for determining the connectivity of complex undirected networks

This page was built for publication: Performance analysis and comparison of algorithms for measures of network connectivity

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