Hypergraph-designs

International audienc

Algebraic methods for trie statistics

Résumé disponible dans les fichiers attaché

Resolvable decomposition of Kn∗

International audienc

Balanced cycles and circuit designs: even cases

International audienc

Hypergraphes hamiltoniens

International audienc

Graph decompositions and G-designs

International audienc

On regular packings and coverings

International audienc

DIMACS Workshop on Interconnection Networks and Mapping, and Scheduling Parallel Computations

The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processor from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future , the book includes topics such as network topologies,network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. inputs for a process are available where and when the process is scheduled to be computed. This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation, held in February 1994. The workshop brought together resea

Decomposition into cycles I: Hamilton decompositions

International audienceIn this part we survey the results concerning the partitions of the edge-set of a graph into Hamilton cycles or into Hamilton cycles and a single perfect matching