Reference : On enumerating the kernels in a bipolar-valued digraph
Scientific journals : Article
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/38741
On enumerating the kernels in a bipolar-valued digraph
English
Bisdorff, Raymond mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Oct-2006
Annales du LAMSADE
Université Paris-Dauphine
6
38
Yes
International
1762-455X
Paris
France
[en] Operations Research ; Graph kernels ; Outranking methods
[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.
http://hdl.handle.net/10993/38741

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
EnumKernels.pdfPublisher postprint533.18 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.