284 search results - page 51 / 57 » On the adaptable chromatic number of graphs |
93
Voted
DAM
2008
15 years 20 days ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
95
Voted
CI
1998
15 years 8 days ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
122
click to vote
ICDCS
2002
IEEE
15 years 5 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
106
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
112
Voted
USENIX
2007
15 years 2 months ago
2007
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...