803 search results - page 60 / 161 » Independence in Direct-Product Graphs |
154
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This article investigates selfish behavior in games where players are embedded in a social context. A framework is presented which allows us to measure the Windfall of Friendship...
105
click to vote
UAI
2004
15 years 5 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
136
click to vote
JGT
2006
15 years 3 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
117
click to vote
SIAMDM
2008
15 years 3 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
118
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...