<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Hamiltonian path problem - Page 21 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Hamiltonian_path_problem&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Hamiltonian_path_problem&amp;p=22">3.Next</a>
</p>
<p>once in c. Additionally, it takes polynomial time to check the start and end vertices, as well as the edges between vertices. Therefore, the algorithm is a polynomial time verifier for the Hamiltonian path problem.</p>

<p><big> Applications </big></p>
<p><big> Networks on chip </big></p>
<p><a href="page.php?w=Network_on_a_chip">Networks on chip</a> (NoC) are used in computer systems and <a href="page.php?w=Processor_%28computing%29">processors</a> serving as communication for on-chip components. The performance of NoC is determined by the method it uses to move</p><p>
<a accesskey="1" href="page.php?w=Hamiltonian_path_problem&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Hamiltonian_path_problem&amp;p=22">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
