284 search results - page 51 / 57 » On the adaptable chromatic number of graphs |
DAM
2008
13 years 7 months 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...
CI
1998
13 years 7 months 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....
ICDCS
2002
IEEE
14 years 9 days 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...
IPPS
2002
IEEE
14 years 8 days 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...
USENIX
2007
13 years 9 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...