Abstract
Given a graph G(V, E), the identifying codes problem is to find the smallest set of vertices D ⊆ V such that no two vertices in V are adjacent to the same set of vertices in D. The identifying codes problem has been applied to fault diagnosis and sensor based location detection in harsh environments. In this paper, we introduce and study a generalization of this problem, namely, the d-identifying codes problem. We propose a polynomial time approximation algorithm based on ideas from information theory and establish its approximation ratio that is very close to the best possible. Using analysis on random graphs, several fundamental properties of the optimal solution to this problem are also derived.
This work was supported by the National Science Foundation under the ITR grant ECS-0426831.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bollobás, B.: Random graphs. Academic Press Inc., London (1985)
Brodie, M., Rish, I., Ma, S.: Optimizing probe selection for fault localization. In: International Workshop on Distributed Systems: Operations and Management (2001)
Das, A., Thulasiraman, K.: Diagnosis of t/s-diagnosable systems. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 193–205 (1990)
Das, A., Thulasiraman, K., Agarwal, V.: Diagnosis of t/(t+1)-diagnosable systems. SIAM J. Comput. 23(5), 895–905 (1994)
Frieze, A., Martin, R., Moncel, J., Ruszinkóand, K., Smyth, C.: Codes identifying sets of vertices in random networks. (submitted for publication, 2005)
Halldórsson, B.V., Halldórsson, M.M., Ravi, R.: On the approximability of the minimum test collection problem. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 158–169. Springer, Heidelberg (2001)
Janson, S., Luczak, T., Rucinski, A.: Random graphs. Wiley, New York (2000)
Janson, S.: New versions of Suen’s correlation inequality. Random Struct. Algorithms 13(3-4), 467–483 (1998)
Karpovsky, M., Chakrabarty, K., Levitin, L.: On a new class of codes for identifying vertices in graphs. IEEE Trans. on Information Theory 44(2), 599–611 (1998)
Laifenfeld, M., Trachtenberg, A.: Disjoint identifying-codes for arbitrary graphs. In: IEEE Symposium on Information Theory (submitted, 2005)
Laihonen, T.: Optimal codes for strong identification. Eur. J. Comb. 23(3), 307–313 (2002)
Preparata, F., Metze, G., Chien, R.: On the connection assignment problem of diagnosiable systems. IEEE Trans. on Electronic Computers 16, 848–854 (1967)
Ray, S., Ungrangsi, R., Pellegrini, F., Trachtenberg, A., Starobinski, D.: Robust location detection in emergency sensor networks. In: INFOCOM (2003)
Suen, S.: A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph. Random Struct. Algorithms 1(2), 231–242 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, Y., Hadjicostis, C., Thulasiraman, K. (2006). The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_31
Download citation
DOI: https://doi.org/10.1007/11809678_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)