How to Use
Select graph:
- Test: Interval?
- Model: Interval assign
- Perfect: χ=ω
Recognition
Fulkerson-Gross (1965): G is interval iff clique matrix has consecutive 1s property. PQ-tree algorithm: O(n+m). LBFS-based: 6 sweeps suffice. Also: chordal + AT-free (Lekkerkerker-Boland).
Applications
Job scheduling: intervals = time slots, conflicts = overlaps. DNA fragment assembly: intervals on genome. Register allocation in compilers. Temporal reasoning. Resource allocation with time windows.
Step-by-Step Instructions
- 1Select graph.
- 2Check interval.
- 3Find interval model.
- 4Compute χ=ω.
- 5Apply scheduling.