The following pages link to (Q3686417):
Displaying 13 items.
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- The design and implementation of an interactive course-timetabling system (Q475210) (← links)
- An introduction to timetabling (Q759645) (← links)
- An existential problem of a weight-controlled subset and its application to school timetable construction (Q1115806) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- Asymmetric decomposability and persegram representation in coherent conditional probability theory (Q2354850) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- An application of edge coloring of graphs to a class scheduling problem (Q2749408) (← links)
- Graph theory applied in school schedule network (Q2910757) (← links)
- (Q3340500) (← links)
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051) (← links)
