Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482343 | European Journal of Operational Research | 2006 | 16 Pages |
Abstract
We explore the extension of the notion of kernel (independent, dominant or absorbent, non-empty subset) of a digraph to valued graphs (or valued relations). We define various natural extensions and show the relationship between them. This work has potential interest for applications in choice decision problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Raymond Bisdorff, Marc Pirlot, Marc Roubens,