49 search results - page 5 / 10 » New Upper Bound for a Class of Vertex Folkman Numbers |
GD
2004
Springer
14 years 1 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
FCT
1999
Springer
14 years 5 days ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...