Skip to content

This website works best using cookies which are currently disabled.Cookie policy  Allow cookies
Mobile
United States of America (English) Change
 

Hamiltonian problem

<computability> (Or "Hamilton's problem") A problem in graph theory posed by William Hamilton: given a graph, is there a path through the graph which visits each vertex precisely once (a "Hamiltonian path")? Is there a Hamiltonian path which ends up where it started (a "Hamiltonian cycle" or "Hamiltonian tour")?

Hamilton's problem is NP-complete. It has numerous applications, sometimes completely unexpected, in computing.

http://ing.unlp.edu.ar/cetad/mos/Hamilton.html.

Hamiltonian problem Related Courses

No related courses found

Hamiltonian problem Related Jobs

Problem Management Manager
Raleigh, NC

Problem Management Manager Use your LinkedIn Profile to help you apply faster! inApply with LinkedInGet hired faster Job ID #: 21176 More...

Senior Problem/Incident Management Analyst
Mayfield Village, OH

Our direct client is in need of a Sr. Problem/Incident Management Analyst to fill a 12-month contract position near Cleveland, OH. Role: More...

Network Technician - LAN
Waukegan, IL

RESPONSIBILITIES: Provide technical problem isolation and resolution for a Global Network. Configures and performs advanced diagnostics on More...

Senior Software Developer - Analytics
Atlanta, Georgia, $90K-$125K base + bonus

Senior Software Developer Exceptional problem solving and resolution skills. Excellent oral and written communication skills. BS/MS in More...

Senior Systems Architect - LS2-SrSysArchitectWA
Bellingham WA, $95k - $150k

Growing Co. in WA seeks problem sovling Sr. Systems Architect Growing Co. in WA seeks Sr. Systems Architect We are a close knit group of More...