Skip to main content

An Improved Strong Connectivity Discriminant Algorithm for Complex Directed Networks

  • Chapter
  • First Online:
  • 757 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1102))

Abstract

The existing network connectivity discriminant algorithms have high time complexity, which could not satisfy the requirement of quick connectivity discrimination for large-scale networks, such as computer networks, communication networks and energy networks, etc. Aiming at the strong connectivity discriminant problem of directed networks, this paper extends the Warshall algorithm from simple directed networks to complex ones and gives an improved discriminant algorithm, which can reduce the time complexity of the Warshall algorithm by half. This is of great practical value to the connectivity discrimination for various large-scale complex directed networks.

This work was supported by the National Natural Science Foundation (NNSF) of China under Grant 61673041.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Rosen, K.H., Xu, L.T., Yang, J., Wu, B.: Discrete Mathematics and Its Applications, 1st edn. China Machine Press, Beijing (2016)

    Google Scholar 

  2. Yin, J.H., Wu, K.Y.: Graph Theory and Its Algorithm, 1st edn. The University of Science and Technology of China Press, Hefei (2016)

    Google Scholar 

  3. Braun, U., et al.: Test-retest reliability of resting-state connectivity network characteristics using fMRI and graph theoretical measures. NeuroImage 59(2), 1404–1412 (2012)

    Article  MathSciNet  Google Scholar 

  4. Imae, T., Cai, K.: On algebraic connectivity of directed scale-free networks. J. Franklin Inst. 355(16), 8065–8078 (2018)

    Article  MathSciNet  Google Scholar 

  5. Zhen, K., Doucette, E.A., Dixon, W.E.: Distributed connectivity preserving target tracking with random sensing. IEEE Trans. Automat. Contr. 64(5), 2166–2173 (2019)

    Article  MathSciNet  Google Scholar 

  6. Min, H., Seo, W., Lee, J., Park, S., Hong, D.: Reliability improvement using receive mode selection in the device-to-device uplink period underlaying cellular networks. IEEE Trans. Wirel. Commun. 10(2), 413–418 (2011)

    Article  Google Scholar 

  7. Yoshioka, C., Namerikawa, T.: Observer-based consensus control strategy for multi-agent system with communication time delay. In: 2008 IEEE International Conference on Control Applications (CCA) Part of the IEEE Multi-Conference on Systems and Control, San Antonio, TX, USA (2008)

    Google Scholar 

  8. Mahmood, M.A., Seah, W.K.G., Welch, I.: Reliability in wireless sensor networks: a survey and challenges ahead. Comput. Netw. 79, 166–187 (2015)

    Article  Google Scholar 

  9. Yan, B., Shi, P., Lim, C.C., Wu, C.F., Shi, Z.Y.: Optimally distributed formation control with obstacle avoidance for mixed-order multi-agent systems under switching topologies. IET Control Theor. A. 12(13), 1853–1863 (2018)

    Article  MathSciNet  Google Scholar 

  10. Zhao, S.Y.: Affine formation maneuver control of multiagent systems. IEEE Trans. Automat. Contr. 63(12), 4140–4155 (2018)

    Article  MathSciNet  Google Scholar 

  11. Su, H.S., Wu, H., Chen, X., Chen, M.Z.Q.: Positive edge consensus of complex networks. IEEE Trans. Syst. Man Cybern. Syst. 48(12), 2242–2250 (2018)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhuo Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Wang, CH., Wang, Z., Wu, ZD. (2019). An Improved Strong Connectivity Discriminant Algorithm for Complex Directed Networks. In: Li, QL., Wang, J., Yu, HB. (eds) Stochastic Models in Reliability, Network Security and System Safety. JHC80 2019. Communications in Computer and Information Science, vol 1102. Springer, Singapore. https://doi.org/10.1007/978-981-15-0864-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0864-6_24

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0863-9

  • Online ISBN: 978-981-15-0864-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics