On enumerating the kernels in a bipolar-valued outranking digraph

Raymond Bisdorff (1)

1 Operations Research Unit

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 bipolarvalued 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.

Mots clés: Graph Theory; Maximum Independent Sets; Enumerating Kernels; Outranking Digraphs

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Raymond Bisdorff. On enumerating the kernels in a bipolar-valued outranking digraph. 2006. ⟨hal-00118995⟩