64 search results - page 5 / 13 » stoc 2001 |
STOC
2001
ACM
16 years 6 days ago
2001
ACM
STOC
2001
ACM
16 years 6 days ago
2001
ACM
102
click to vote
STOC
2001
ACM
16 years 6 days ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
STOC
2001
ACM
16 years 6 days ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
89
Voted
STOC
2001
ACM
16 years 6 days 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...