Tolerant location detection in sensor networks
From MaRDI portal
Publication:2280052
Recommendations
Cites work
- Connected Identifying Codes
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- ID codes in Cartesian products of cliques
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Identifying codes of Cartesian product of two cliques of the same size
- More results on the complexity of identifying problems in graphs
- On a new class of codes for identifying vertices in graphs
- On a new class of identifying codes in graphs
- On identifying codes that are robust against edge changes
- On robust and dynamic identifying codes
- On vertex-robust identifying codes of level three.
- The CRC handbook of combinatorial designs
Cited in
(6)- Extremal cubic graphs for fault-tolerant locating domination
- Locating and identifying codes in circulant graphs
- Tolerant identification with Euclidean balls
- Bounds and extremal graphs for total dominating identifying codes
- Optimal error-detection system for identifying codes
- Fault detection based on interval observers and dynamic event-triggered fault-tolerant control for morphing aircraft
This page was built for publication: Tolerant location detection in sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280052)