Questions tagged [acyclic-orientations]

An acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any directed cycle and therefore makes it into a directed acyclic graph. Every graph has an acyclic orientation.

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
1 vote
0 answers
44 views

What is the number of iterations needed for the message passing algorithm to converge when applied to an acyclic factor graph?

I understand that the message passing algorithm (Belief Propagation algorithm), when applied to a factor graph consists in an exchange in messages between the factor nodes and the variable nodes, ...
e. sfe's user avatar
  • 39