This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 1. Which of the following cluster trees satisfies the running intersection property? a) b) c) 2. Assume that we have a Clique tree T over X such that, for every pair of nodes X , Y ∈ X , there exists a clique that contains both X and Y. Prove that T must contain a single clique that contains all of X ....
View Full Document
This document was uploaded on 03/03/2011.
- Winter '09