255 search results - page 15 / 51 » A new upper bound for the bipartite Ramsey problem |
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
FCT
1999
Springer
15 years 4 months 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
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
101
click to vote
JGAA
2006
14 years 11 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...