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

h-index (December 2020): 35

i10-index (December 2020): 152

h5-index (December 2020): N/A

h5-median(December 2020): N/A

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact