Example of Polynomial Time Reduction

• Hamiltonian path is polynomial time reducible to spanning tree of degree 4.

  • Given G = (V,E)
  • Construct G’ = (V’,E’)
  • f(G) = G’
  • G has Hamiltonian path if and only if G’ has a spanning tree of degree 4

Previous slide

Next slide

Back to first slide

View graphic version