Theoretical-graph approach for research of the rank of the special sparse   matrix to the sensor location problem for the multi graphs

Pilipchuk, L. A.; Vishnevetskaya, T. S.

Issue Date Author Title Subject

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/10694

Title:	Theoretical-graph approach for research of the rank of the special sparse matrix to the sensor location problem for the multi graphs
Authors:	Pilipchuk, L. A. Vishnevetskaya, T. S.
Keywords:	ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика
Issue Date:	2011
Publisher:	БГУ
Citation:	Международный конгресс по информатике: информационные системы и технологии: материалы международного научного конгресса 31 окт. – 3 нояб. 2011 г. : в 2 ч. Ч. 2. – Минск: БГУ, 2011. – C. 354-356.
Abstract:	We consider algorithms decomposition linear systems with embedded network structure for research of the rank of the special sparse block-diagonal matrix for the multi graph. One of applications of the given approach is the Sensor Location Problem (SLP), that is the location of the minimum number of the sensors for the nodes of the multi network, in order to determine the arcs flow volume and nodes with variable intensities for all the network
Description:	Секция 10. Теоретическая информатика
URI:	http://elib.bsu.by/handle/123456789/10694
ISBN:	978-985-518-564-3
Appears in Collections:	2011. Международный конгресс по информатике : информационные системы и технологии. Часть 2. Статьи факультета прикладной математики и информатики

Files in This Item:

File	Description	Size	Format
77 Pilipchuk.pdf		334,54 kB	Adobe PDF	View/Open

Show full item record Google Scholar