Scheduling to reduce conflict in meetings
- 1 June 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (6) , 351-352
- https://doi.org/10.1145/362384.362394
Abstract
Conflicts in scheduling can be treated as defining an undirected linear graph independently of the relation of the activities in conflict to additional constraints of time and space. Each connected component of such a graph, which can be found by an algorithm described by Gotlieb and Corneil, corresponds to a set of events that must be scheduled at different times.Keywords
This publication has 4 references indexed in Scilit:
- Algorithms for finding a fundamental set of cycles for an undirected linear graphCommunications of the ACM, 1967
- An algorithm for class scheduling with section preferenceCommunications of the ACM, 1967
- Scheduling meetings with a computerCommunications of the ACM, 1964
- Final examination schedulingCommunications of the ACM, 1964