A set of vertices S of a connected graph G is a nonseparating independent set if S is independent and G–S is connected. The nsis number 𝒵(G) is the maximum cardinality of a nonseparating independent ...
The standard decomposition theorem for additive and multiplicative utility functions (Pollak 1967, Keeney 1974) assumes that the outcome set is a whole product set. In this paper this assumption is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback