Last Updated :2025/11/25

arboricity

Noun
countable uncountable
Japanese Meaning
グラフ理論において、無向グラフの辺を森林(循環を持たないグラフ)の集合に分割するために必要な最小の森林の数。
What is this buttons?

大規模な無向グラフの辺をいくつの森林に分割できるかの最小数を計算することは、効率的な並列処理のために必要な個別の森林部分グラフの数を判断するのに役立ちます。

plural

Quizzes for review

(graph theory) The minimum number of forests into which the edges of an undirected graph may be partitioned.

音声機能が動作しない場合はこちらをご確認ください
See correct answer

arboricity

Computing the arboricity of a large undirected graph can help determine how many forests are needed to partition its edges for efficient parallel processing.

See correct answer

Computing the arboricity of a large undirected graph can help determine how many forests are needed to partition its edges for efficient parallel processing.

音声機能が動作しない場合はこちらをご確認ください

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
Editing Guideline

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★