570 search results - page 28 / 114 » Edge Coloring with Delays |
COMBINATORICA
2010
14 years 9 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
135
click to vote
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
16 years 7 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
108
click to vote
CIARP
2007
Springer
15 years 6 months 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...
ISCAS
2003
IEEE
15 years 5 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...
COMBINATORICS
2006
14 years 12 months ago
2006
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...