Codes identifying sets of vertices in random networks (Q870971): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the length of disjunctive codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: New versions of Suen's correlation inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of optimal codes for strong identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two families of optimal identifying codes in binary Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound of the size of the \(r\)-cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph / rank
 
Normal rank

Latest revision as of 15:06, 25 June 2024

scientific article
Language Label Description Also known as
English
Codes identifying sets of vertices in random networks
scientific article

    Statements

    Identifiers