59 search results - page 6 / 12 » soda 2003 |
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
SODA
2000
ACM
15 years 1 months ago
2000
ACM
This presentation covers several sections of the paper by Berkman, Parnas and Sgall for the Advanced Topics in Network Security seminar. Ben-Gurion University of the Negev, fall 2...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...