IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
IMI >
IMI Periodicals >
Mathematica Balkanica >
Mathematica Balkanica New Series, Vol. 27, 2013, Fasc. 1-2 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2613

Title: Sensor Location Problem for a Multigraph
Authors: Pilipchuk, L. A.
Vishnevetskaya, T. S.
Pesheva, Y. H.
Keywords: Sparse linear system
underdetermined system
basis of the solution space of a homogeneous sparse linear system
network support
decomposition of a support
forest of trees
characteristic vector
variable intensity
sensor location problem
Issue Date: 2013
Publisher: Bulgarian Academy of Sciences - National Committee for Mathematics
Citation: Mathematica Balkanica New Series, Vol. 27, Fasc 1-2 (2013), 65p-75p
Abstract: We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities. One of the new applications of the researched underdetermined systems is the sensor location problem (SLP) for a multigraph. That is the location of the minimum number of sensors in the nodes of the multigraph, in order to determine the arcs ow volume and variable intensities of nodes for the whole multigraph. Research of the rank of the sparse matrix is based on the constructive theory of decomposition of sparse linear systems.
Description: MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35
URI: http://hdl.handle.net/10525/2613
ISSN: 0205-3217
Appears in Collections:Mathematica Balkanica New Series, Vol. 27, 2013, Fasc. 1-2

Files in This Item:

File Description SizeFormat
MB-27-065-075.pdf275.24 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License