Budgeted sensor placement for source localization on trees

DOI10.1016/j.endm.2015.07.012zbMath1347.05030OpenAlexW2206179665MaRDI QIDQ324722

Mohammad Hasan, M. Dambrine

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.012

zbMATH Keywords

double resolvabilitysensor placementsource localization

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Metric dimension of critical Galton-Watson trees and linear preferential attachment trees ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices

Cites Work

• Approximability of the Minimum Weighted Doubly Resolving Set Problem
• On the Metric Dimension of Cartesian Products of Graphs
• Rumors in a Network: Who's the Culprit?

This page was built for publication: Budgeted sensor placement for source localization on trees