Reference : On linear decompositions of L-valued simple graphs
E-prints/Working papers : First made available on ORBilu
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/38736
On linear decompositions of L-valued simple graphs
English
Bisdorff, Raymond mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Jun-1996
CRP - Centre Universitaire
9
Yes
[en] Operations Research ; Graph Theory ; Kernel computation
[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.
CRP - Centre Universitaire
http://hdl.handle.net/10993/38736

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
notedecomp1996.pdfPublisher postprint296.61 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.