1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2015★ 1 cited
Algorithmic Aspects of Upper Domination
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel +6
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a…
cs.GT2010★ 1 cited
Minimum regulation of uncoordinated matchings
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a de…