Sequence Covering Arrays and Linear Extensions

DOI10.1007/978-3-319-19315-1_24zbMath1401.05051OpenAlexW2294159173MaRDI QIDQ2946063

Charles J. Colbourn, Patrick Murray

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_24

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Unnamed Item
• Dimensions of hypergraphs
• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• On the conductance of order Markov chains
• Counting linear extensions
• Directed \(t\)-packings and directed \(t\)-Steiner systems
• Randomized post-optimization of covering arrays
• Containment problems in high-dimensional spaces
• Fast perfect sampling from linear extensions
• On the minimum number of completely 3-scrambling permutations
• Boxicity and Separation Dimension
• Total Ordering Problem
• A Geometric Approach to Betweenness
• A note on scrambling permutations
• Scrambling permutations and entropy of hypergraphs
• Randomized Post-optimization for t-Restrictions
• Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix
• Sequence Covering Arrays
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements

This page was built for publication: Sequence Covering Arrays and Linear Extensions