Talk:Junction tree algorithm

Robotics Start‑class Mid‑importance

	This article is within the scope of WikiProject Robotics, a collaborative effort to improve the coverage of Robotics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.RoboticsWikipedia:WikiProject RoboticsTemplate:WikiProject RoboticsRobotics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-importance on the project's importance scale.

Spanning tree?

The page says: "Construct a junction tree from this (form a maximal spanning tree)". What is the relationship between a junction tree and maximal spanning tree? A5 (talk) 12:58, 9 September 2008 (UTC)[reply]

The phrase in the parentheses implies the junction tree formation is similar to forming a spanning tree on the original graph, but that's misleading: to form a junction tree you first construct a hypergraph according to cliques in the triangulated graph, and then you construct a spanning tree on those supernodes. To answer your question in short, the junction tree is a maximal spanning tree, but not on the original graph (instead, it's on a graph constructed from the original graph). 128.31.34.229 (talk) 15:12, 2 December 2008 (UTC)[reply]

Jordan

Contact Michael I Jordan- he pretty much invented the junction tree and will be able to provide the background information for this page. His book, which covers it in Chapter 17, is due to be published in the next year or two. —Preceding unsigned comment added by 79.68.59.167 (talk) 08:24, 23 October 2008 (UTC)[reply]