[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.
Research center :
CRP - Centre Universitaire
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)
Language :
English
Title :
On linear decompositions of L-valued simple graphs