This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: n vertices? HW 2 due today Q1, Q2 and Q3 in different piles I will not take any HW after 1:15pm Tree Connected undirected graph with no cycles Rooted Tree A rooted tree Pick any vertex as root Let the rest of the tree hang under “gravity” How many rooted trees can an n vertex tree have? How many rooted trees can an n vertex tree have? SG’s parent=AC SG’s parent=AC AC’ s chil d=S G AC’ s chil d=S G Rest of Today’s agenda Prove n vertex tree has n1 edges Algorithms for checking connectivity Checking by inspection What about large graphs? s t Are s and t connected? Bruteforce algorithm? List all possible vertex sequences between s and t Check if any is a path between s and t n n such sequences n n such sequences Algorithm motivation al l al l...
View
Full Document
 Fall '11
 RUDRA
 Graph Theory, Planar graph, vertices, different piles

Click to edit the document details