Codes identifying sets of vertices in random networks
DOI10.1016/J.DISC.2006.07.041zbMATH Open1160.94021DBLPjournals/dm/FriezeMMRS07OpenAlexW2154298980WikidataQ57401488 ScholiaQ57401488MaRDI QIDQ870971FDOQ870971
Alan Frieze, Julien Moncel, Ryan R. Martin, Cliff Smyth, Miklós Ruszinkó
Publication date: 15 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.041
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- On a new class of codes for identifying vertices in graphs
- Paths in graphs
- Nonrandom binary superimposed codes
- A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
- New versions of Suen's correlation inequality
- Title not available (Why is that?)
- On the upper bound of the size of the \(r\)-cover-free families
- Title not available (Why is that?)
- On \(r\)-cover-free families
- Two families of optimal identifying codes in binary Hamming spaces
- Bounds on the length of disjunctive codes
- Families of optimal codes for strong identification
Cited In (21)
- The identifying code number and Mycielski's construction of graphs
- Constructing codes identifying sets of vertices
- Identifying and locating-dominating codes in (random) geometric networks
- Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs
- Vertex identifying codes for fault isolation in communication networks
- Title not available (Why is that?)
- Liar's domination
- Improved bounds on identifying codes in binary Hamming spaces
- Identifying codes and searching with balls in graphs
- On the size of identifying codes in binary hypercubes
- Identifying path covers in graphs
- Watching systems in graphs: an extension of identifying codes
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
- On the limiting distribution of the metric dimension for random forests
- Upper bounds for binary identifying codes
- Identifying codes of cycles with odd orders
- Title not available (Why is that?)
- Locating-dominating sets: from graphs to oriented graphs
- Sequential metric dimension for random graphs
- Codes Identifying Vertices in Graphs
- Extension of universal cycles for globally identifying colorings of cycles
This page was built for publication: Codes identifying sets of vertices in random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870971)
