2165 search results - page 213 / 433 » cases 2005 |
156
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
121
click to vote
WDAG
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...
143
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
WINE
2005
Springer
15 years 10 months ago
2005
Springer
Organizational employees have different knowledge demands and the knowledge is compound. So how to push the right compound knowledge to the right organizational employees becomes i...
137
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...