4541 search results - page 469 / 909 » Cache-Oblivious Algorithms and Data Structures |
135
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
147
click to vote
GD
2004
Springer
15 years 10 months ago
2004
Springer
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph view...
132
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
131
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
148
click to vote
SWAT
2000
Springer
15 years 8 months ago
2000
Springer
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...