A Decision Algorithm of Strong Connexity Convenient for Parallel Computation


  •  Ruixian Li    

Abstract

In this article, the author puts forward a new decision algorithm of strong connexity, which can conduct the two-time search in the decision process simultaneously, and this algorithm is convenient for the parallel computation.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1913-8989
  • ISSN(Online): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

WJCI (2020): 0.439

Impact Factor 2020 (by WJCI): 0.247

Google Scholar Citations (March 2022): 6907

Google-based Impact Factor (2021): 0.68

h-index (December 2021): 37

i10-index (December 2021): 172

(Click Here to Learn More)

Index

Contact