[en] In this report we will present a linear decomposition of a given L-
valued binary relation into a set of sub-relations of kernel-dimension one.
We will apply this theoretical result to the design of a faster algorithm for
computing L-valued kernels on general L-valued simple graphs.
Centre de recherche :
CRP - Centre Universitaire
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)
Langue du document :
Anglais
Titre :
On linear decompositions of L-valued simple graphs
