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.
- Full Text:
PDF
- DOI:10.5539/cis.v3n3p146
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
- Academic Journals Database
- BASE (Bielefeld Academic Search Engine)
- CiteFactor
- CNKI Scholar
- COPAC
- CrossRef
- DBLP (2008-2019)
- EBSCOhost
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- Google Scholar
- Harvard Library
- Infotrieve
- LOCKSS
- Mendeley
- PKP Open Archives Harvester
- Publons
- ResearchGate
- Scilit
- SHERPA/RoMEO
- Standard Periodical Directory
- The Index of Information Systems Journals
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WJCI Report
- WorldCat
Contact
- Chris LeeEditorial Assistant
- cis@ccsenet.org