On linear decompositions of L-valued simple graphs

Reference : On linear decompositions of L-valued simple graphs


	Document type :	E-prints/Working papers : First made available on ORBilu
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Computational Sciences
	To cite this reference:	http://hdl.handle.net/10993/38736

Title :	On linear decompositions of L-valued simple graphs
Language :	English
Author, co-author :	Bisdorff, Raymond [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	Jun-1996
Publisher :	CRP - Centre Universitaire
Number of pages :	9
Peer reviewed :	Yes
Keywords :	[en] Operations Research ; Graph Theory ; Kernel computation
Abstract :	[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 centres :	CRP - Centre Universitaire
Permalink :	http://hdl.handle.net/10993/38736

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	notedecomp1996.pdf		Publisher postprint	296.61 kB	View/Open

All documents in ORBi^lu are protected by a user license.