[en] In this paper we would like to thoroughly cover the problem of computing all
kernels, i.e. minimal outranking and/or outranked independent choices in a bipolar-
valued outranking digraph. First we introduce in detail the concept of bipolar-valued characterisation of outranking digraphs, choices and kernels. In a second section we present and discuss several algorithms for enumerating the kernels in a crisp digraph. A third section will be concerned with extending these algorithms to bipolar-valued outranking digraphs.
Disciplines :
Sciences informatiques
Auteur, co-auteur :
BISDORFF, Raymond ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Co-auteurs externes :
no
Langue du document :
Anglais
Titre :
On enumerating the kernels in a bipolar-valued digraph
