A Decision Algorithm of Strong Connexity Convenient for Parallel Computation

Ruixian Li


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.

Full Text: PDF DOI: 10.5539/cis.v3n3p146

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Computer and Information Science   ISSN 1913-8989 (Print)   ISSN 1913-8997 (Online)
Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.