Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On vertex-robust identifying codes of level three.

From MaRDI portal
Publication:3094530
Jump to:navigation, search

zbMATH Open1240.94139MaRDI QIDQ3094530FDOQ3094530

Iiro Honkala, Tero Laihonen

Publication date: 25 October 2011





Recommendations

  • A family of optimal identifying codes in \(\mathbb Z^2\)
  • On 2-edge robust \(r\)-identifying codes in the king grid
  • General bounds for identifying codes in some infinite regular graphs
  • On robust and dynamic identifying codes
  • Identifying codes with small radius in some infinite regular graphs


zbMATH Keywords

identifying codecovering codebinary hypercubeinfinite gridvertex robustness


Mathematics Subject Classification ID

Other types of codes (94B60)



Cited In (5)

  • On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
  • A family of optimal identifying codes in \(\mathbb Z^2\)
  • Tolerant location detection in sensor networks
  • On Iiro Honkala's contributions to identifying codes
  • On identifying codes that are robust against edge changes





This page was built for publication: On vertex-robust identifying codes of level three.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094530)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3094530&oldid=16161905"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:49. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki