consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with weak … digraph constraint (SSGW). In both problems there is given a digraph with sizes assigned to the vertices. Within SSG we want … provide pseudo-polynomial solutions for SSG and SSGW with digraph constraints given by directed co-graphs and series …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … coalition. The hierarchical strength of a player in a coalition in an acyclic digraph is the number of admissible permutations … (those in which successors in the digraph enter before predecessors) where this player is the last of that coalition to enter …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … coalition. The hierarchical strength of a player in a coalition in an acyclic digraph is the number of admissible permutations … (those in which successors in the digraph enter before predecessors) where this player is the last of that coalition to enter …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … coalition. The hierarchical strength of a player in a coalition in an acyclic digraph is the number of admissible permutations … (those in which successors in the digraph enter before predecessors) where this player is the last of that coalition to enter …