Unformatted text preview: o p q r 3. Prove that the output of INTERVAL-CLIQUE is a maximum clique. 4. Find a shortest closed walk that use each edge at least once. Justify the optimality of your solution. e a b c d Important —– No Late Homework Will be Accepted —–...
View Full Document
This note was uploaded on 02/17/2009 for the course MATH 4171 taught by Professor Lax,r during the Spring '08 term at LSU.
- Spring '08
- Graph Theory