Article (Scientific journals)
On enumerating the kernels in a bipolar-valued digraph
Bisdorff, Raymond
2006In Annales du LAMSADE, 6, p. 38
Peer reviewed
 

Files


Full Text
EnumKernels.pdf
Publisher postprint (545.97 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Operations Research; Graph kernels; Outranking methods
Abstract :
[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 :
Computer science
Author, co-author :
Bisdorff, Raymond ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
no
Language :
English
Title :
On enumerating the kernels in a bipolar-valued digraph
Publication date :
October 2006
Journal title :
Annales du LAMSADE
ISSN :
1762-455X
Publisher :
Université Paris-Dauphine, Paris, France
Volume :
6
Pages :
38
Peer reviewed :
Peer reviewed
Focus Area :
Computational Sciences
Available on ORBilu :
since 11 February 2019

Statistics


Number of views
75 (10 by Unilu)
Number of downloads
20 (1 by Unilu)

Bibliography


Similar publications



Contact ORBilu