753 search results - page 7 / 151 » Completing a (k - 1)-Assignment |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
GD
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
DM
2010
13 years 7 months ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
VLDB
2005
ACM
14 years 27 days ago
2005
ACM
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
SIGECOM
2003
ACM
14 years 20 days ago
2003
ACM
This paper discusses an interested party who wishes to influence the behavior of agents in a game (multi-agent interaction), which is not under his control. The interested party ...