SIGN IN
SIGN UP
A graph formulation of a school scheduling algorithm
Full Text:
PDF
Buy this Article
Authors:
A. Salazar
Stanford Univ., Stanford, CA
R. V. Oakford
Stanford Univ., Stanford, CA
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 17 Issue 12, Dec 1974
Pages 696-698
ACM
New York, NY
, USA
table of contents
doi>
10.1145/361604.361625
1974 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 17
· Downloads (cumulative): 423
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
examination scheduling
graph
nondirected network
scheduling
scheduling
school scheduling
sequencing and scheduling
strongly connected subgraph
subgraph
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder