37 search results - page 1 / 8 » A Coloring Solution to the Edge Crossing Problem |
IV
2009
IEEE
13 years 11 months ago
2009
IEEE
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
We propose a new technique for edge-suppressing operations on images. We introduce cross projection tensors to achieve affine transformations of gradient fields. We use these tens...
AUSAI
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...