4171 search results - page 32 / 835 » Choice numbers of graphs |
120
click to vote
AMMA
2009
Springer
15 years 8 months ago
2009
Springer
I study school assignment problems, focusing on two popular mechanisms: the Boston Mechanism (BM) and Deferred Acceptance (DA). The former has been criticized regarding both e¢ c...
SIGIR
2009
ACM
15 years 8 months ago
2009
ACM
In numerous everyday domains, it has been demonstrated that increasing the number of options beyond a handful can lead to paralysis and poor choice and decrease satisfaction with ...
SCHOLARPEDIA
2008
15 years 1 months ago
2008
A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by start...
137
click to vote
MICS
2010
15 years 10 days ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
138
click to vote
EJC
2008
15 years 2 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...