Access Restriction

Author Grimes, Joseph E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Allocation ♦ Conflict matrix ♦ Spanning tree ♦ Connected component ♦ Scheduling ♦ Undirected linear graph
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.
Description Affiliation: Cornell Univ., Ithaca, NY (Grimes, Joseph E.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 13
Issue Number 6
Page Count 2
Starting Page 351
Ending Page 352

Open content in new tab

   Open content in new tab
Source: ACM Digital Library