RSA
2011
13 years 5 months ago
2011
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
ENDM
2002
13 years 10 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
EOR
2007
13 years 11 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
COMBINATORICS
2007
13 years 11 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
DM
2006
13 years 11 months ago
2006
For n, k and t such that 1 < t < k < n, a set F of subsets of [n] has the (k, t)threshold property if every k-subset of [n] contains at least t sets from F and every (k -...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
FCT
2007
Springer
14 years 24 days ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
ICDAR
2003
IEEE
14 years 4 months ago
2003
IEEE
When scanning documents with a large number of pages such as books, it is often feasible to provide a minimal number of training samples to personalize the system to compensate fo...
SWAT
2004
Springer
14 years 4 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...