	Log in \| Register \|

First ACM International Conference on Web Search and Data Mining - WSDM 2008

Connectivity Structure of Bipartite Graphs via the KNC-Plot

author: Erik Vee, Yahoo! Research

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Connectivity Structure of Bipartite Graphs via the KNC-Plot
0:09	The fundamental question…
0:25	Macroscopic Success Stories
0:57	Macroscopic models of graphs: Understanding connectivity
1:45	Our Goals
2:29	Outline
2:49	The k-neighborhood graph, Gk (1)
3:18	The k-neighborhood graph, Gk (2)
3:34	The k-neighborhood graph, Gk (3)
3:47	The k-neighborhood graph, Gk (4)
3:54	Illustration k=1
4:08	Illustration k=2
4:11	Illustration k=3
4:12	Illustration k=4
4:13	Illustration k=5
4:17	The KNC-plot
4:50	Analysis
6:11	Examples (1)
7:27	Examples (2)
8:12	Examples (3)
8:55	Examples (4)
9:38	Algorithms (1)
10:27	Algorithms (2)
11:16	Alg-Intersect (1)
11:32	Alg-Intersect (2)
12:08	Alg-Tuples (1)
12:42	Alg-Tuples (2)
13:16	Combining them (1)
13:42	Combining them (2)
13:57	Finding S
14:30	Combining them
15:19	Extensions
15:49	Conclusion

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.