328 search results - page 42 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
SPAA
2004
ACM
14 years 29 days ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
CCCG
2003
13 years 9 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...