2 articles for “Hamiltonian Paths”

Set a search alert

Research ArticleOpen accessPhrase in the titleOn Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci CubesIoana Zelina, Grigor Moldovan, Ioana TascuThe interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,281 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsp ≠ np: The Set of Deterministic Problems that are Solvable in Polynomial Time is Unequal to the Set of Non-Deterministic Problems that are Solvable in Polynomial TimeAndres BoldoriThis study constructs a solution to the “p vs. np” problem using complexity theory. We show through counterexamples that p ≠ np and formalize the two sets using stochastic, probabilistic and non-deterministic modeling. While the well-known sets “pspace” and “npspace”, analyzing the storage of a device, can be claimed to be equal, p and np differ and are exclusively defined … …Journal of Computer Science, Vol. 20, Issue 10 · 8 Aug 2024 · 7,106 accessesView PDF Cite