4 results for “hamiltonian path”

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

Research ArticleOpen accessIn the abstractSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDNA Code Word Design for DNA Computing with Real-Time Polymerase Chain ReactionMuhammad Faiz Mohamed Saaid, Zuwairie Ibrahim, Mohamad Shukri Zainal Abidin et al.Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during a computation. We have … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,502 accessesView PDF Cite