scientific article; zbMATH DE number 2081125
From MaRDI portal
Publication:4474243
zbMATH Open1057.94035MaRDI QIDQ4474243FDOQ4474243
Authors: Tero Laihonen, Sanna Ranto 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2227/22270082.htm
Title of this publication is not available (Why is that?)
Recommendations
Combinatorial codes (94B25) Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12)
Cited In (24)
- On codes identifying sets of vertices in Hamming spaces
- Two families of optimal identifying codes in binary Hamming spaces
- Codes identifying sets of vertices in random networks
- Vertex identifying codes for fault isolation in communication networks
- Liar's domination
- Families of optimal codes for strong identification
- Optimal codes for strong identification
- On two variations of identifying codes
- The minimum identifying code graphs
- On cages admitting identifying codes
- Watching systems in graphs: an extension of identifying codes
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
- Optimal identification of sets of edges using 2-factors
- Characterizing identifying codes from the spectrum of a graph or digraph
- Partial linear spaces and identifying codes
- Identifying codes in trees and planar graphs
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Adaptive identification in graphs
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- Vertex identifying codes for the \(n\)-dimensional lattice
- On strongly identifying codes
- Sequences of optimal identifying codes
- Edge identifying codes
- Codes Identifying Vertices in Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474243)
