4171 search results - page 27 / 835 » Choice numbers of graphs |
AAMAS
2002
Springer
14 years 11 months ago
2002
Springer
An evolutionary approach to the problem of economic mechanism choice is presented. It demonstrates the power that a single participant has on the choice of a preferred market mecha...
122
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
The focus of the work in this paper is the evaluation of a model of human decision making relative to experimental data. In sequential two-alternative forced choice decision tasks,...
102
click to vote
DAM
2007
14 years 11 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
GD
2003
Springer
15 years 5 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
DM
2010
14 years 12 months ago
2010
For a graph G let