「Hamiltonian」の共起表現一覧(1語右が「path.」)
該当件数 : 14件
| If there is a | Hamiltonian path in the graph, then the algorithm will |
| Clearly, if a certain general graph has a | Hamiltonian path, this Hamiltonian path is the longest |
| tonian-connected graphs (graphs that have a | Hamiltonian path connecting every pair of vertices). |
| A | Hamiltonian path on the knight's tour graph is a knight |
| only Archimedean dual which does not have a | Hamiltonian path among its vertices. |
| lem can be shown using a reduction from the | Hamiltonian path problem. |
| Additionally, a | Hamiltonian path exists between vertices u,v iff u,v ar |
| ch pair of vertices can be connected with a | Hamiltonian path (Thomassen 1980). |
| The | Hamiltonian path problem is NP-complete, and hence the |
| sists of one path if and only if there is a | Hamiltonian path in G. |
| of an arbitrary tree so that it contains a | Hamiltonian path (the size of its Hamiltonian completio |
| the graph without repetition, and this is a | Hamiltonian path by definition. |
| ceable graphs, graphs that do not contain a | Hamiltonian path but such that every subset of n − 1 ve |
| y are the trees whose line graphs contain a | Hamiltonian path; such a path may be obtained by the or |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
