Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Com S 631: Lower bounds and Separation Results Lecture 5 Scribe: Adam Case
 

Summary: Com S 631: Lower bounds and Separation Results
Lecture 5 Scribe: Adam Case
1. Pebbling Continued
Let G = (V, E) be a DAG that can be pebbled using p pebbles. Let V1 = all vertices in
G that can be pebbled using p
2
pebbles and V2 = V - V1. Let G1 = (V1, E1) be the graph
induced by V1 and G2 = (V2, E2) be the graph induced by V2. In the previous lecture, we
proved two claims about graphs G1 and G2.
Claim 1. G1 requires p
2
- d pebbles when a game is restricted to G2.
Claim 2. G2 requires p
2
- d pebbles when a game is restricted to G1.
Our goal is to prove the following recurrence relation.
R(p) 2R(p/2 - d) +
p
4d
.

  

Source: Aduri, Pavan - Department of Computer Science, Iowa State University

 

Collections: Computer Technologies and Information Sciences