252 search results - page 4 / 51 » Decremental Clique Problem |
86
Voted
EUROPAR
2000
Springer
15 years 1 months ago
2000
Springer
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
GC
2011
Springer
14 years 1 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
106
click to vote
DISOPT
2011
14 years 1 months ago
2011
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...