Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Hamiltonian path problem · Vinony

EntityQ987652· pop 13· linked from 40 articles

Hamiltonian path problem

Sign in to save

computational problem in graph theory

Connections

Hamiltonian path

International Standard Book Number

computer network

digital object identifier

International Standard Serial Number

three-dimensional space

dynamic programming

Categories

Computational problems in graph theory Hamiltonian paths and cycles NP-complete problems

Sources

wikipedia.externallinksexternallink

What links here40 pages

Escherichia coli

natural computing

optical computer

Hamiltonian path

computational complexity theory

travelling salesperson problem

Game of the Amazons

average-case complexity

subgraph isomorphism problem

Karp's 21 NP-complete problems

longest path problem

minimum spanning tree

1994 in science

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

maximum flow problem

Entitydist 0.35

Entitydist 0.43

route inspection problem

Entitydist 0.43

Barnette's conjecture

Entitydist 0.47

Dijkstra's algorithm

Entitydist 0.47

graph toughness

Entitydist 0.51

Entitydist 0.52

extremal graph theory

Entitydist 0.53

Hadwiger–Nelson problem

Entitydist 0.54

Entitydist 0.55

planar straight-line graph

Entitydist 0.56

minimum-cost flow problem

Entitydist 0.56