Optimal regular graph designs
From MaRDI portal
Publication:1702287
DOI10.1007/s11222-016-9720-8zbMath1384.62280arXiv1502.05287OpenAlexW2963860517MaRDI QIDQ1702287
Publication date: 28 February 2018
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.05287
Optimal statistical designs (62K05) Combinatorial aspects of block designs (05B05) Statistical block designs (62K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the optimality of block designs
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- On the E-optimality of PBIB designs with a small number of blocks
- Optimality of some two-associate-class partially balanced incomplete- block designs
- Optimality of certain asymmetrical experimental designs
- Theory of optimal designs
- Fast generation of regular graphs and construction of cages
- Optimal Incomplete Block Designs
- Experimental design for gene expression microarrays
- Near-Optimal Designs for Dual Channel Microarray Studies
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
This page was built for publication: Optimal regular graph designs