Adaptive identification in graphs

DOI10.1016/J.JCTA.2007.12.009MaRDI QIDQ958720zbMATH OpenOpenAlexFDO

Authors Yael Ben-Haim, Sylvain Gravier, Julien Moncel, Antoine Lobstein

Publication date 8 December 2008

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2007.12.009

zbMATH Keywords

coveringpackingadaptiveCodesidentifying

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Adaptive identification of sets of vertices in graphs
• Adaptive aggregation on graphs
• scientific article; zbMATH DE number 6253970
• Graph signatures: identification and optimization
• A graph theoretical approach to the parameters identifiability characterisation
• Adaptive estimation of nonparametric geometric graphs
• An optimal lower bound on the number of variables for graph identification

Cites work

• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 2081125 (Why is no real title available?)
• scientific article; zbMATH DE number 1436153 (Why is no real title available?)
• scientific article; zbMATH DE number 3272069 (Why is no real title available?)
• Adaptive identification in graphs
• Construction of codes identifying sets of vertices
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• General bounds for identifying codes in some infinite regular graphs
• Identifying codes with small radius in some infinite regular graphs
• On a 2-dimensional search problem
• On a new class of codes for identifying vertices in graphs
• On codes identifying sets of vertices in Hamming spaces
• On identification in the triangular grid
• On identifying codes in binary Hamming spaces
• On the identification of sets of points in the square lattice
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• The minimum density of an identifying code in the king lattice.

Cited in

(10)

• Identification in \(\mathbb Z^2\) using Euclidean balls
• Adaptive aggregation on graphs
• Identifying codes and searching with balls in graphs
• Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
• Identifying codes of degree 4 Cayley graphs over abelian groups
• Adaptive identification of sets of vertices in graphs
• Adaptive identification in graphs
• Predicting the labels of an unknown graph via adaptive exploration
• Sequential metric dimension
• Adaptive identification in Torii in the King lattice

This page was built for publication: Adaptive identification in graphs

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