Sciweavers

425 search results - page 6 / 85
» Path Coloring on the Mesh
Sort
View
DM
2010
103views more  DM 2010»
14 years 11 months ago
Rainbow paths
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...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...
MICCAI
2002
Springer
16 years 16 days ago
Labeling the Brain Surface Using a Deformable Multiresolution Mesh
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 ...
Sylvain Jaume, Benoit M. Macq, Simon K. Warfield
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
14 years 11 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
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...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
14 years 11 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
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 ...
Vera Rosta
COMCOM
2008
158views more  COMCOM 2008»
14 years 11 months ago
Load aware traffic engineering for mesh networks
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...
Devu Manikantan Shila, Tricha Anjali