Sensor Location Problem for a Multigraph
| Data(s) |
21/07/2016
21/07/2016
2013
|
|---|---|
| Resumo |
MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35 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. |
| Identificador |
Mathematica Balkanica New Series, Vol. 27, Fasc 1-2 (2013), 65p-75p 0205-3217 |
| Idioma(s) |
en |
| Publicador |
Bulgarian Academy of Sciences - National Committee for Mathematics |
| Palavras-Chave | #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 |
| Tipo |
Article |
