An improved strong connectivity discriminant algorithm for complex directed networks

  • Cheng Hong Wang
  • , Zhuo Wang*
  • , Zhen Dong Wu
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationCommunications in Computer and Information Science
PublisherSpringer Verlag
Pages465-474
Number of pages10
DOIs
StatePublished - 2019

Publication series

NameCommunications in Computer and Information Science
Volume1102
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Keywords

  • Complex directed network
  • Connectivity discriminant algorithm
  • Strong connectivity
  • Time complexity

Cite this