Last Updated：2025/11/22
Sentence
大きなグラフで最大独立集合の頂点数（α(G)と表される）を求めることは計算的に困難な場合があるため、近似アルゴリズムがよく用いられます。
Quizzes for review
Determining the independence number of a large graph can be computationally challenging, so approximation algorithms are often used.
See correct answer
Determining the independence number of a large graph can be computationally challenging, so approximation algorithms are often used.
音声機能が動作しない場合はこちらをご確認ください
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
