Last Updated：2025/12/01
Sentence
大規模な疎グラフのハミルトン性を判定することは、理論計算機科学において依然として難しい問題である。
Quizzes for review
Determining the Hamiltonicity of a large sparse graph remains a challenging problem in theoretical computer science.
See correct answer
Determining the Hamiltonicity of a large sparse graph remains a challenging problem in theoretical computer science.
音声機能が動作しない場合はこちらをご確認ください
Related words
Hamiltonicity
Noun
uncountable
Japanese Meaning
ハミルトン閉路を持つ性質。すなわち、グラフが全ての頂点を一度ずつ通る閉路（ハミルトン閉路）を有する状態の性質。
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
