Pages that link to "Item:Q3557518"
From MaRDI portal
The following pages link to Identifying and Locating–Dominating Codes in (Random) Geometric Networks (Q3557518):
Displaying 16 items.
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Identification of points using disks (Q1618247) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- Locating and identifying codes in circulant graphs (Q2244371) (← links)
- On the limiting distribution of the metric dimension for random forests (Q2349959) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Tolerant identification with Euclidean balls (Q5326789) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)