原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
e which lecture hall. (This problem is also known as the interval-graph coloring problem.
It is modeled by an interval graph whose vertices are the given activities and whose edges connect incompatible activities.
The smallest number of colors required to color every vertex so that no two adjacent vert
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea