Pages that link to "Item:Q2920473"

The following pages link to Approximability of the Minimum Weighted Doubly Resolving Set Problem (Q2920473):

Displaying 11 items.

• Budgeted sensor placement for source localization on trees (Q324722) (← links)
• A novel approach for detecting multiple rumor sources in networks with partial observations (Q512871) (← links)
• Extending the metric dimension to graphs with missing edges (Q897908) (← links)
• Metric dimension of critical Galton-Watson trees and linear preferential attachment trees (Q2033923) (← links)
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
• Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
• On doubly resolving sets in graphs (Q2082367) (← links)
• The power of adaptivity in source identification with time queries on the path (Q2118878) (← links)
• The equidistant dimension of graphs (Q2147613) (← links)
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
• The \(k\)-metric dimension (Q2410025) (← links)