This preview shows page 1. Sign up to view the full content.
Unformatted text preview: s to x for some vertex x . 3. (14 points) Chapter 25 : Dominating Sets: In the paper On calculating connected dominating set for efficient routing in ad hoc wireless networks two rules for modifying the dominating set are presented on p. 9 of Section 3. a) Prove that applying Rule 1 to ' G to produce subgraph } { ' v G results in } { ' v G being a connected subgraph of ' G . b) Prove that applying Rule 2 to ' G to produce subgraph } { ' v G results in } { ' v G being a connected subgraph of ' G . 4. (40 points) Chapter 26 : Flow Networks ( Escape Problem ): Problem 261 on p. 760761 (a)(b)....
View Full
Document
 Spring '11
 Staff
 Algorithms

Click to edit the document details