Professional Documents
Culture Documents
Linear Sketches
10
AB
B
B
B
Bv
B
B
B
@
C = @Mv A ! answer
C
C
C
C
C
C
C
A
Sketching Graphs?
?
0
@
10
AB
B
B
B
B
B
B
B
@
1
AG
C= @
C
C
C
C
C
C
C
A
MAG
A ! answer
G2=(V,E2)
G3=(V,E3)
G4=(V,E4)
MG1
MG2
MG3
MG4
Output: MG=MG1+MG2+MG3+MG4
a) Connectivity
b) Applications
Connectivity
Sketch
Algorithm
Original Graph
ANSWER
Algorithm
Sketch Space
a1 =
a2 =
1 1 0 0 0 0 0 0 0 0
1 0 0 0 1 0 0 0 0 0
support
X
i2S
ai
= E (S, V \ S)
Ingredient 3: l0-Sampling
Ci aj = Ci @
X
j2S
aj A ! e 2 support(
X
j2S
aj ) = E (S, V \ S)
Connectivity
Sketch
Algorithm
Original Graph
ANSWER
Algorithm
Sketch Space
a) Connectivity
b) Applications
k-Connectivity
Original Graph
Sparsifier Graph
Algorithm (k-Connectivity):
1. Let F1 be spanning forest of G(V,E)
2.For i=2 to k:
2.1. Let Fi be spanning forest of G(V,E-F1-...-Fi-1)
Lemma: G(V,F1+...+Fk) is k-connected iff G(V,E) is.
k-Connectivity
Original Graph
Sparsifier Graph
Bipartiteness
Summary