Abstract
In this paper we present some results related to the conference problem: a set of meetings (each one of them involving two persons) has to be scheduled within a time period of k days. The problem consists of finding a schedule that is as uniform as possible for each person. A graph theoretical model is described and some applications in the area of scheduling are mentioned.

This publication has 3 references indexed in Scilit: