425 search results - page 6 / 85 » Path Coloring on the Mesh |
DM
2010
15 years 1 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
113
click to vote
MICCAI
2002
Springer
16 years 2 months ago
2002
Springer
We propose to match a labeled mesh onto the patient brain surface in a multiresolution way for labeling the patient brain. Labeling the patient brain surface provides a map of the ...
125
Voted
ALGORITHMICA
2006
15 years 1 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
109
click to vote
COMBINATORICS
2000
15 years 1 months ago
2000
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
115
click to vote
COMCOM
2008
15 years 1 months ago
2008
Wireless Mesh Network (WMN) is a multi-hop mesh network that consists of mesh routers and mesh clients, where mesh routers are static and form the backbone of the mesh network. Th...