基于点着色理论的期末考试时间安排问题毕业论文.docxVIP

附件 1 论文题目：  论文编号 《图论》课程 专题论文 基于顶点着色理论的 期末考试时间安排问题 专 业：数学与应用数学 班 级：2012 级数学与应用数学班 组 长： 年  月  日 摘要 随着 Internet 的发展和我国高校校园网的普及,采用计算机网络进 行考试安排的需求非常迫切 ,而考试冲突问题又是考试安排的核心 ,使 用顶点着色算法设计一个高效的考试安排系统 ,解决考试冲突问题 ,使 考务工作适应信息化的需求 ,实现管理的科学化、自动化 ,最大程度为 教师和同学们提供方便是本论文研究的重点 本文应用图论的原理将数学与计算机科学学院 2014 级考试安排 问题转化为对图的顶点着色问题。提出用求图的极大独立集的方法求 解图的点色数，并用布尔方法计算图的极大独立集, 有效的避免了相 同班级的不同考试科目在同一时间进行考试的问题 关键词 顶点着色问题 考试安排 布尔算法 ABSTRACT With the development of Internet and the popularization of campus network in Colleges and universities in China. It is urgent to use computer network to carry out the test arrangement and the examination conflict problem is the core of the examination arrangement. Using vertex coloring algorithm to design an efficient examination arrangement system, solve the conflict problem of examination examination work, to meet the needs of informationization, the realization of scientific management and automation, the greatest degree for teachers and students to facilitate the research focus of this paper. In this paper, the principle of graph theory is applied to the problem of 2014 levels of the computer science college. It is proposed to solve the problem of the same class of different test subjects in the same time by using the maximal independent set of the graph. Keyword:  Vertex coloring problem Examination arrangement Boor Algorithm 目 录 摘要 ......................................................................................................... 2 关键字 ..................................................................................................... 2 ABSTRACT ............................................................................................ 3 Keyword: ................................................................................................. 3 引 言 ....................................................................................................... 5 着色问题知识背景 ................................................................................. 6 顶点着色应用 .