127 search results - page 2 / 26 » Acyclic dominating partitions |
AAAI
2012
11 years 7 months ago
2012
In AI research, mechanism design is typically used to allocate tasks and resources to agents holding private information about their values for possible allocations. In this conte...
AICCSA
2005
IEEE
13 years 11 months ago
2005
IEEE
COMBINATORICS
2004
13 years 5 months ago
2004
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
DAM
2007
13 years 5 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
SBACPAD
2003
IEEE
13 years 10 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...