Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xian De Zhang / rank
Normal rank
 
Property / author
 
Property / author: Xian De Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1008.1608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing 𝑘-radius sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group divisible designs with block-size four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of group divisible designs with block size three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering block designs. Gray codes, universal cycles and configuration orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generating subsets of fixed size with a strong minimal change property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal coverings of pairs by triples / 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: Q4865141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in the block-intersection graph of pairwise balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in block-intersection graphs of triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles of \(k\)-subsets and \(k\)-permutations / 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: Q3688397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent interchange generation of combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of cache-efficient algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
scientific article

    Statements

    Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    alternating Hamiltonian cycle
    0 references
    block intersection graph
    0 references
    group divisible design
    0 references
    minimum covering
    0 references
    sequence of radius two
    0 references
    Steiner triple system
    0 references
    universal cycle
    0 references
    0 references