21 search results - page 3 / 5 » dam 2011 |
DAM
2011
13 years 14 days ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
DAM
2011
13 years 14 days ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
DAM
2011
13 years 14 days ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
DAM
2011
13 years 14 days ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
DAM
2011
13 years 14 days ago
2011
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...