Random subgraphs make identification affordable

DOI10.4310/JOC.2017.v8.n1.a3zbMath1352.05167arXiv1306.0819MaRDI QIDQ501982

Guillem Perarnau, Oriol Serra, Florent Foucaud

Publication date: 10 January 2017

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0819

zbMATH Keywords

identifying codesrandom subgraphsidentifying code of a graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Locating-Domination and Identification

This page was built for publication: Random subgraphs make identification affordable