Evènement pour le groupe GT Graphes et Applications

Date 2013-10-18  14:00-15:00
TitrePartition Graphs and characterization of designs by graph homomorphims  
RésuméSoftware testing makes use of combinatorial designs called covering arrays. These arrays are a generalization of Latin Squares and orthogonal arrays. Idealy we look to use the smallest possible array for the given parameters, but this is a hard problem. We define a family of graphs, partition graphs, which give a full charatcerization of optimal covering arrays using homomorphisms. These graphs have interesting properties and many interesting open questions.  
LieuSalle 178 
OrateurBrett Stevens 

Aucun document lié à cet événement.

Retour à l'index