2310 search results - page 217 / 462 » Coloring Random Graphs |
DAM
2008
13 years 8 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
JCT
2006
13 years 8 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
PR
2006
13 years 8 months ago
2006
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...
CVGIP
2004
13 years 8 months ago
2004
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
IPL
2006
13 years 8 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...