Random subgraphs make identification affordable

MaRDI QIDQ6826689zbMATH OpenFDO

Authors Florent Foucaud, Guillem Perarnau, Oriol Serra

Publication date 11 June 2014

zbMATH Keywords

identifying 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)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826689)