Everand Logo

Welcome to Everand!

  • Discover millions of ebooks, audiobooks, and so much more with a free trial

    Only $11.99/month after trial. Cancel anytime.

    Unavailable
    Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm
    Unavailable
    Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm
    Unavailable
    Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm
    Ebook79 pages21 minutes

    Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm

    By Alexander Dumpling

    ()

    Currently unavailable

    Currently unavailable

    About this ebook

    Among different classes of computational complexity, NP-complete problems are those of particular practical significance. The class of NP-complete problems considers those problems that are more difficult than other problems in NP and which are currently considered to be unlikely to be solvable (that is, they're unlikely to be decision problems from P). The question that is currently not answered is whether the class of decision problems that can be solved in polynomial time with a deterministic Turing machine is equal to the class of NP problems, P = NP.


    We consider the Hamiltonian-path problem in undirected finite graphs with no multiple edges between a given pair of nodes as a problem that is known to be NP-complete. Any other decision problem from NP is known to be polynomial-time reducible to the Hamiltonian-path problem, which implies that having found a polynomial-time algorithm to resolve it, we would also be able to resolve any other problem from NP with a polynomial-time algorithm and thus demonstrate that P = NP.


    If it could be demonstrated that P = NP, there would be polynomial-time algorithms for computational problems that are currently considered unsolvable but currently the overwhelming consensus is that P is not equal to NP. Unless P = NP, there are problems in NP that are neither in P nor NP-complete. A polynomial-time algorithm for a problem known to be NP-complete would be a stunning breakthrough.


    The Hamiltonian-Path algorithm described in the current work has been developed by Alexander Dumpling. You will be allowed to apply the results from this work and the algorithm in your practical computational situations, provided that you confirm and acknowledge the authorship of Alexander Dumpling with regard to the algorithm described in the current work.

    LanguageEnglish
    PublisherPublishdrive
    Release dateJun 1, 2018
    Unavailable
    Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm

    Related to Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm

    Related ebooks

    Programming For You

    View More
    View More

    Related podcast episodes

    Related articles

    • Article

      Microcontrollers In Amateur Radio

      Aug 1, 2022

      My way of teaching about program data has always been a little different than the way most approach the subject. As you may know, pointers in C are a special type of variable that allows you to access data in a very efficient manner. Indeed, many com

      6 min read

    • Article

      What Is Cfd

      Jun 21, 2022

      What Is Cfd
      3 min read

    • Article

      How To Solve Mazes Using Go And Maths

      May 5, 2020

      This month, we’re going delve into solving maze and dungeon puzzles with the help of graph theory (well, we are all in isolation–Ed). The purpose of such puzzles is to determine whether there’s a path that connects two places and find that path, keep

      7 min read

    • Article

      Babbage And Running His Many Engines

      Nov 16, 2021

      Mike Bedford Like most of us, Mike tended to think of the likes of Alan Turing and John von Neumann as the pioneers of computing, so delving further into Charles Babbage’s creations was truly inspiring. Discussion about the first ever computer often

      11 min read

    • Article

      To Understand Your Past, Look to Your Future: An alternative to the Newtonian worldview promises to help explain quantum weirdness.

      May 19, 2016

      You’re thinking about time all wrong, according to our best physical theories. In Einstein’s general theory of relativity, there’s no conceptual distinction between the past and the future, let alone an objective line of “now.” There’s also no sense

      9 min read

    • Article

      FRAQTIVE Exploring The World Of Fractals

      Jun 4, 2019

      Prepare to be amazed! In this tutorial, and in next issue’s follow up, we’re going to be looking at fractals, a subject that is both visually and technically astonishing. Typically at this point we’d start by explaining what we mean by the word fract

      10 min read

    • Article

      A Universe Made of Tiny, Random Chunks: The space-time that makes up our universe is inherently uncertain.

      Jun 6, 2013

      One of science’s most crucial yet underappreciated achievements is the description of the physical universe using mathematics—in particular, using continuous, smooth mathematical functions, like how a sine wave describes both light and sound. This is

      6 min read

    • Article

      Physicists Attack Math’s $1,000,000 Question

      Apr 4, 2017

      Physicists are attempting to map the distribution of the prime numbers to the energy levels of a particular quantum system.

      4 min read

    • Article

      Missing Links

      Aug 5, 2022

      Over the last couple of months, I have been working with a number of junior engineers at senior undergraduate level and junior post graduate level. While their enthusiasm has never been in question, I am shocked by the lack of basic skills I am seein

      7 min read

    • Article

      Are Neural Networks About to Reinvent Physics?

      Nov 21, 2019

      Can AI teach itself the laws of physics? Will classical computers soon be replaced by deep neural networks? Sure looks like it, if you’ve been following the news, which lately has been filled with headlines like, “A neural net solves the three-body p

      9 min read

    • Article

      Pen To Paper

      Feb 2, 2024

      Over the last couple of months, I have been working with a number of junior engineers at senior undergraduate and junior postgraduate level. While their enthusiasm has never been in question, I am shocked by the lack of basic skills I am seeing. The

      7 min read

    • Article

      Analog Adventures

      Aug 1, 2019

      Analog Adventures
      5 min read

    • Article

      Analog Adventures

      Dec 1, 2020

      Analog Adventures
      7 min read

    • Article

      Clever CAD Coding For Clients And Cigars

      Apr 2, 2024

      Credit: http://openscad.org Tam Hanna’s minimal creative capability makes him ideally suited to teaching all kinds of workarounds for problems that require the use of creativity. Catch up by ordering back issues on page 58! The experiments performed

      7 min read

    Reviews for Finding Hamiltonian paths in traceable graphs with a polynomial-time algorithm

    0 ratings

    0 ratings0 reviews

    What did you think?

    Tap to rate

    Review must be at least 10 words