Constructing Optimal $k$-Radius Sequences (Q2797088): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sequentially additive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of \(k\)-radius sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing 𝑘-radius sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of large radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consecutive storage of relevant records with redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simply sequentially additive labelings of 2-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of asymptotically shortest \(k\)-radius sequences / rank
 
Normal rank

Latest revision as of 17:54, 11 July 2024

scientific article
Language Label Description Also known as
English
Constructing Optimal $k$-Radius Sequences
scientific article

    Statements

    Constructing Optimal $k$-Radius Sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-radius sequences
    0 references
    \(k\)-additive sequences
    0 references
    \(k\)-perfect sequences
    0 references
    sequentially additive labelings of graphs
    0 references
    0 references