| Webster's Online Dictionary |
| Expressions | Definition | ||
| Hamiltonian path | In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected graph which visits each vertex exactly once. A Hamiltonian cycle is a cycle in an undirected graph which visits each vertex exactly once and also returns to the starting vertex. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem which is NP-complete. (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
| Expressions | Domain | Definition | |
| Hamiltonian path | Computing | Hamiltonian path Hamiltonian problem. Source: The Free On-line Dictionary of Computing.. | |
Source: compiled by the editor from various references; see credits. | Top | ||
Topics by Level of Interest: HAMILTONIAN PATH | ||||
| Topics sorted by level of Interest | Level (1=low, 600=high) | Topics sorted Alphabetically | Level (1=low, 600=high) | |
| Hamiltonian path problem | 6 | Hamiltonian path problem | 6 | |
Source: the editor, created by/for EVE to gauge likely levels of human interest in linguistically triggered topics (compiled across various sources, such as Wikipedia and specialty expression glosses). | ||||
