Connected Identifying Codes

No abstract is available for this paper.

• Publication year

  2012

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2012-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2012.2191934
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Connected identifying codes for sensor network monitoring

  2011influential reference
• Connecting identifying codes and fundamental bounds

  2011cited by this paper
• Robust Localization Using Identifying Codes

  2009cited by this paper
• Identifying Codes and Covering Problems

  2008cited by this paper
• Approximability of identifying codes and locating-dominating codes

  2007cited by this paper
• Codes identifying sets of vertices in random networks

  2007cited by this paper
• Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes

  2007cited by this paper
• On robust and dynamic identifying codes

  2006cited by this paper
• Identifying Codes and the Set Cover Problem

  2006cited by this paper
• Discrete sensor placement problems in distribution networks

  2005cited by this paper
• Construction of Codes Identifying Sets of Vertices

  2005cited by this paper
• Tighter Bounds for Graph Steiner Tree Approximation

  2005cited by this paper
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

  2005cited by this paper
• Connected Dominating Set in Sensor Networks and MANETs

  2004cited by this paper
• The minimum density of an identifying code in the king lattice

  2004cited by this paper
• Robust location detection with sensor networks

  2004influential reference
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

  2003influential reference
• Robust location detection in emergency sensor networks

  2003cited by this paper
• Identifying Codes with Small Radius in Some Infinite Regular Graphs

  2002cited by this paper
• Identifying and locating-dominating codes: NP-Completeness results for directed graphs

  2002cited by this paper
• On Identifying Codes in Binary Hamming Spaces

  2002cited by this paper
• Codes Identifying Sets of Vertices

  2001cited by this paper
• General Bounds for Identifying Codes in Some Infinite Regular Graphs

  2001cited by this paper
• New Bounds for Codes Identifying Vertices in Graphs

  1999cited by this paper
• On identifying codes

  1999cited by this paper
• On a New Class of Codes for Identifying Vertices in Graphs

  1998influential reference
• New Approximation Algorithms for the Steiner Tree Problems

  1997cited by this paper
• A threshold of ln n for approximating set cover (preliminary version)

  1996cited by this paper
• Approximation Algorithms for Connected Dominating Sets

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• New Approximation Algorithms for the Steiner Tree Problem

  1989cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper
• Algorithm 447: efficient algorithms for graph manipulation

  1973cited by this paper
• Efficient algorithms for graph manipulation

  1971cited by this paper
• Journal of Combinatorial Theory, Series A

  year unknowncited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper

• New Optimal Results on Codes for Location in Graphs

  2023cites this paper
• Tolerant location detection in sensor networks

  2020cites this paper
• On t-revealing codes in binary Hamming spaces

  2019cites this paper
• On regular and new types of codes for location-domination

  2018cites this paper
• On Stronger Types of Locating-dominating Codes

  2018cites this paper
• Solving a Conjecture on Identification in Hamming Graphs

  2018cites this paper
• Information retrieval and the average number of input clues

  2017cites this paper
• Improved codes for list decoding in the Levenshtein's channel and information retrieval

  2017cites this paper
• Minimum Number of Input Clues in Robust Information Retrieval

  2016cites this paper
• Information Retrieval With Varying Number of Input Clues

  2016influential citation
• Information retrieval with unambiguous output

  2015cites this paper