208 search results - page 37 / 42 » Improved upper bounds on the crossing number |
117
click to vote
STOC
2002
ACM
16 years 1 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
158
click to vote
PADS
1999
ACM
15 years 5 months ago
1999
ACM
We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important...
PODC
2009
ACM
16 years 2 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
128
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
126
click to vote
ECCC
2010
14 years 10 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...