ta3_question - n vertices. Prove that there is a vertex v...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
COMP 271H Design and Analysis of Algorithms 2006 Fall Semester Tutorial 3 1. When a vertex and its incident edges are removed from a tree, a collection of subtree remains. Let T be a tree with
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n vertices. Prove that there is a vertex v whose removal produces no subtree with more than n/ 2 vertices. Design a O ( n )-time algorithm Fnd such a vertex v . 1...
View Full Document

This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.

Ask a homework question - tutors are online