arXiv 0710.36032007-10cs.DMcs.DSmath.CO

On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling

Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudova

发表信息：: Annals of Operations Research (2010) 179(1), 105-130
DOI：: 10.1007/s10479-010-0716-z

英文摘要：

Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex colouring and introduces a formulation of vertex colouring using a suitable clique partition of the graph. This formulation is applicable in timetabling applications, where such a clique partition of the conflict graph is given implicitly. In contrast with some alternatives, the presented formulation can also be easily extended to accommodate complex performance indicators (``soft constraints'') imposed in a number of real-life course timetabling applications. Its performance depends on the quality of the clique partition, but encouraging empirical results for the Udine Course Timetabling problem are reported.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Semidefinite Programming in Timetabling and Mutual-Exclusion Scheduling

In scheduling and timetabling applications, the mutual-exclusion constraint stipulates that certain pairs of tasks that cannot be executed at the same time. This corresponds to the vertex colouring problem in graph theory, for which there are well-known semidefinite programming (SDP) relaxations. In practice, however, the mutual-exclusion constraint is typically combined with many other constraints, whose SDP representability has not been studied. We present SDP relaxations for a variety of mutual-exclusion scheduling and timetabling problems, starting from a bound on the number of tasks execu…

2019-04-06cs.DMmath.OC

Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide

A graph is $(H_1,H_2)$-free for a pair of graphs $H_1,H_2$ if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. In 2001, Král', Kratochv\'ıl, Tuza, and Woeginger initiated a study into the complexity of Colouring for $(H_1,H_2)$-free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those $(H_1,H_2)$-free graphs where $H_2$ is $\overline{H_1}$, the complement of $H_1$. As these classes are closed under complementation, the computational complexities of Colouring and Clique Cover coincide. By combining new and known results, we ar…

2017-06-07cs.CCcs.DMcs.DS

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3

A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A $k$-clique-colouring of a graph is a colouring of the vertices with at most $k$ colours such that no clique is monochromatic. Défossez proved that the 2-clique-colouring of perfect graphs is a $Σ_2^P$-complete problem [J. Graph Theory 62 (2009) 139--156]. We strengthen this result by showing that it is still $Σ_2^P$-complete for weakly chordal graphs. We then determine a hierarchy of nested subclasses of weakly chordal graphs whereby each graph class is in a distinct complexity class, namely $Σ…

2013-12-11cs.CCcs.DMmath.CO

Colouring perfect graphs with bounded clique number

A graph is perfect if the chromatic number of every induced subgraph equals the size of its largest clique, and an algorithm of Grötschel, Lovász, and Schrijver from 1988 finds an optimal colouring of a perfect graph in polynomial time. But this algorithm uses the ellipsoid method, and it is a well-known open question to construct a "combinatorial" polynomial-time algorithm that yields an optimal colouring of a perfect graph. A skew partition in $G$ is a partition $(A,B)$ of $V(G)$ such that $G[A]$ is not connected and $\bar{G}[B]$ is not connected, where $\bar{G}$ denotes the complement graph…

2017-07-12cs.DMmath.CO

Colouring Square-Free Graphs without Long Induced Paths

The complexity of {\sc Colouring} is fully understood for $H$-free graphs, but there are still major complexity gaps if two induced subgraphs $H_1$ and $H_2$ are forbidden. Let $H_1$ be the $s$-vertex cycle $C_s$ and $H_2$ be the $t$-vertex path $P_t$. We show that {\sc Colouring} is polynomial-time solvable for $s=4$ and $t\leq 6$, strengthening several known results. Our main approach is to initiate a study into the boundedness of the clique-width of atoms (graphs with no clique cutset) of a hereditary graph class. We first show that the classifications of boundedness of clique-width of $H$-…

2018-05-21cs.CCcs.DMcs.DS

Colouring Diamond-free Graphs

The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for $(\mbox{diamond},H)$-free graphs. Our proof is based on combining known results together with proving that the clique-width is bounded for $(\mbox{diamond}, P_1+2P_2)$-free graphs. Our technique for handling this case is to reduce the graph under consideration to a $k$-partite graph that has a very specific decomposition. As a by-product of this general technique we are als…

2016-09-05cs.DMmath.CO

更多相关论文收起更多论文

关于着色反棱柱图复杂度的研究

On the complexity of colouring antiprismatic graphs

针对着色反棱柱图（即棱柱图团覆盖问题）复杂度未知的问题，本文提出了两种多项式时间算法，分别解决不可定向棱柱图的团覆盖问题和所有棱柱图的顶点不相交三角形问题。

2019-10-24cs.DMmath.CO

合并宽度的变种及其应用

Variants of Merge-Width and Applications

University of Warsaw（华沙大学）；Institute for Basic Science (IBS)（韩国基础科学研究院）

本文研究了合并宽度的变种，提出了新的刻画方法，并展示了其在图论中的应用，包括近似算法和稀疏商图的性质。

2026-02-27cs.DMcs.DSmath.CO

Graph Homomorphism Reconfiguration and Frozen $H$-Colourings

For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $φ$ and $ψ$ of $G$, does there exist a sequence $f_0,\dots,f_m$ of $H$-colourings such that $f_0=φ$, $f_m=ψ$ and $f_i(u)f_{i+1}(v)\in E(H)$ for every $0\leq i<m$ and $uv\in E(G)$? If the graph $G$ is loop-free, then this is the equivalent to asking whether it possible to transform $φ$ into $ψ$ by changing the colour of one vertex at a time such that all intermediate mappings are $H$-colourings. In the affirmative, we say that $φ$ reconfigures to $ψ$. …

2017-12-01cs.CCcs.DMmath.CO

Solving the clique cover problem on (bull, $C_4$)-free graphs

We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull, $C_4$)-free graph, or equivalently, a minimum colouring of a (bull, $2K_2$)-free graph, where $n$ is the number of vertices of the graphs.

2017-04-02cs.DM

Clique-Width for Hereditary Graph Classes

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general can be shown to be polynomial-time solvable on ${\cal G}$. For this reason, the boundedness or unboundedness of clique-width has been investigated and determined for many graph classes. We survey these results for hereditary graph classes, which are the graph classes closed under taking induced subgraphs. We then discuss the algorithmic consequences of these r…

2019-01-07cs.CCcs.DMcs.DS

Colouring graphs with no induced six-vertex path or diamond

The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is ($P_6$, diamond)-free if it contains no induced subgraph isomorphic to a six-vertex path or a diamond. In this paper we show that the chromatic number of a ($P_6$, diamond)-free graph $G$ is no larger than the maximum of 6 and the clique number of $G$. We do this by reducing the problem to imperfect ($P_6$, diamond)-free graphs via the Strong Perfect Graph Theorem, dividing the imperfect graphs into several cases, and giving a proper colouring for each case. We also show that there is exactl…

2021-06-16cs.DMmath.CO

在双向树中请求集合的干扰有向图着色

Colouring the interference digraph of a set of requests in a bidirected tree

École normale supérieure de Rennes（雷恩高等师范学院）；Université Côte d’Azur, CNRS, Inria, I3S（蔚蓝海岸大学、法国国家科学研究中心、法国研究与计算机科学研究所、I3S）；LISN, Université Paris-Saclay（LISN、巴黎萨克雷大学）

本文研究了在双向树中请求集合的干扰有向图着色问题，提出了一种2近似算法以最小化波长数量，并证明了该问题在参数k下的固定参数可解性。

2026-03-02cs.DM

Building a larger class of graphs for efficient reconfiguration of vertex colouring

A $k$-colouring of a graph $G$ is an assignment of at most $k$ colours to the vertices of $G$ so that adjacent vertices are assigned different colours. The reconfiguration graph of the $k$-colourings, $\mathcal{R}_k(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two colourings are joined by an edge in $\mathcal{R}_k(G)$ if they differ in colour on exactly one vertex. For a $k$-colourable graph $G$, we investigate the connectivity and diameter of $\mathcal{R}_{k+1}(G)$. It is known that not all weakly chordal graphs have the property that $\mathcal{R}_{k+1}(G)$ is connected.…

2020-03-03cs.DM

正方形的Packing、Hitting与Colouring

Packing, Hitting, and Colouring Squares

本文研究了非轴平行正方形的packing与hitting问题，首次给出了τ/ν比率的非平凡上界（单位正方形为6，变体为10），并利用该方法界定了χ/ω比率，填补了正方形几何对象常数界限研究的空白。

2024-06-03cs.CGcs.DMmath.CO

Parametrised Algorithms for Directed Modular Width

Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on measuring how close a digraph is to an oriented tree resp. a directed acyclic graph, in this paper, we investigate directed modular width as a parameter, which is closer to the concept of clique-width. We investigate applications of modular decompositions of directed graphs to a wide range of algorithmic problems and derive FPT-algorithms for several well-kno…

2019-05-30cs.DMmath.CO