1363 search results - page 126 / 273 » The road coloring problem |
146
click to vote
RSA
2000
15 years 6 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
178
click to vote
ACID
2006
15 years 7 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
158
click to vote
ISCIS
2009
Springer
16 years 27 days ago
2009
Springer
—Range scanners are used in various applications in industry. Therefore, various range scanners, based on different working principles are developed. Among these, scanners using ...
192
click to vote
CIARP
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. This paper presents a methodology for the automatic segmentation of rock-scenes using a combination of range and intensity vision. A major problem in rock scene segmentat...
168
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...