Sciweavers

4171 search results - page 27 / 835
» Choice numbers of graphs
Sort
View
AAMAS
2002
Springer
13 years 8 months ago
On the Natural Selection of Market Choice
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...
Aviv Bergman, Moshe Tennenholtz
CDC
2010
IEEE
114views Control Systems» more  CDC 2010»
13 years 3 months ago
Modeling and evaluation of decision-making dynamics in sequential two-alternative forced choice tasks
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,...
Caleb Woodruff, Kristi A. Morgansen, Linh Vu, Damo...
DAM
2007
141views more  DAM 2007»
13 years 8 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
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...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
GD
2003
Springer
14 years 1 months ago
Track Drawings of Graphs with Constant Queue Number
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 ...
Emilio Di Giacomo, Henk Meijer
DM
2010
83views more  DM 2010»
13 years 8 months ago
Packing edge-disjoint cycles in graphs and the cyclomatic number
For a graph G let
Jochen Harant, Dieter Rautenbach, Peter Recht, Fri...