Skip to content
ml-recall

#junction-tree

1 question from Probabilistic & Graphical Models

Timed test

1 question · 1 min · score and explanations at the end

Take a test
Q 1 / 1Score 0 / 0

Question 1: Short answer

hardAI-checkedProbabilistic & Graphical Models

A graph is chordal if every cycle of length 4 or more has a chord. What is the smallest number of edges that must be added to the undirected graph below to make it chordal?

an integer