An upper bound for the chromatic number of a graph and its application to timetabling problems
From MaRDI portal
Publication:5524918
DOI10.1093/comjnl/10.1.85zbMath0147.15206OpenAlexW2108301529WikidataQ29302438 ScholiaQ29302438MaRDI QIDQ5524918
M. B. Powell, Dominic J. A. Welsh
Publication date: 1967
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/10.1.85
Related Items
Periodic assignment and graph colouring, Measurements of quantum Hamiltonians with locally-biased classical shadows, A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations, Elective course student sectioning at Danish high schools, Complexity Insights of the Minimum Duplication Problem, Comparison of metaheuristic algorithms for examination timetabling problem, A survey of search methodologies and automated system development for examination timetabling, Operational research in education, Coloration de graphes : fondements et applications, Developing a scalable hybrid MPI/OpenMP unstructured finite element model, A simple nc recognition algorithm for welsh-powell opposition graphs, Efficiently enumerating all maximal cliques with bit-parallelism, Online algorithms for the maximum \(k\)-colorable subgraph problem, A cellular memetic algorithm for the examination timetabling problem, A new exact maximum clique algorithm for large and massive sparse graphs, Vertex arboricity and vertex degrees, Mutual exclusion scheduling, Simple decentralized graph coloring, Welsh-Powell opposition graphs, An existential problem of a weight-controlled subset and its application to school timetable construction, Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring, Sequential coloring versus Welsh-Powell bound, On the closure of graphs under substitution, A generalization of interval edge-colorings of graphs, Extremal values of the chromatic number for a given degree sequence, Graph Coloring Using Eigenvalue Decomposition, Optimization of the integrated problem of employee timetabling and job shop scheduling, Vertex coloring of a graph for memory constrained scenarios, A multiobjective framework for heavily constrained examination timetabling problems, Mapping Cohesive Fracture and Fragmentation Simulations to Graphics Processor Units, Multi-constructor CMSA for the maximum disjoint dominating sets problem, Recursive grain remapping scheme for phase‐field models of additive manufacturing, Consecutive colorings of graphs, Graphs isomorphisms under edge-replacements and the family of amoebas, The parallel complexity of elimination ordering procedures, Partially concurrent open shop scheduling with integral preemptions, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Dynamic data resolution to improve the tractability of UMTS network planning, Local optimization of colorings of graphs, A graph-based hyper-heuristic for educational timetabling problems, On colouring random graphs, Modal logic S5 in answer set programming with lazy creation of worlds, On the equality of the partial Grundy and upper ochromatic numbers of graphs, A comparison of bounds for the chromatic number of a graph, An integer programming formulation for a case study in university timetabling., Complexity insights of the minimum duplication problem, Chromatic optimisation: Limitations, objectives, uses, references, Fast algorithms for determining (generalized) core groups in social networks, Improved bounds for the chromatic index of graphs and multigraphs, Partitions of graphs into small and large sets, Practices in timetabling in higher education institutions: a systematic review, Unnamed Item, Best monotone degree conditions for graph properties: a survey, Solving the examination timetabling problem in GPUs, The smallest hard-to-color graph, CasADi: a software framework for nonlinear optimization and optimal control, Unnamed Item, Bounded colouring motivated by the limited resource partially concurrent open shop problem, A wide-ranging computational comparison of high-performance graph colouring algorithms, A branch-and-cut procedure for the Udine course timetabling problem, Linear combinations of heuristics for examination timetabling, An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Approximation algorithms for combinatorial problems, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Some observations on the determination of an upper bound for the clique number of a graph, On the chromatic number of graphs, Hybrid heuristics for examination timetabling problem, Compactness and balancing in scheduling, Some sequential graph colouring algorithms, Maximum independent sets near the upper bound, A branch-and-cut algorithm for partition coloring, Algorithmic bounds for the chromatic number†, Privacy-preserving data splitting: a combinatorial approach, Minimum partition of an independence system into independent sets, A randomised heuristical algorithm for estimating the chromatic number of a graph, Recognition of some perfectly orderable graph classes, An incremental search heuristic for coloring vertices of a graph, An introduction to timetabling, Three new upper bounds on the chromatic number, Decomposition, reformulation, and diving in university course timetabling, A search space ``cartography for guiding graph coloring heuristics, Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks, A sequential coloring algorithm for finite sets, Lower bounds for the clique and the chromatic numbers of a graph, The variational quantum eigensolver: a review of methods and best practices, Inequalities involving the irredundance number of a graph, Numerical experiences with graph coloring algorithms, Een indelingsprobleem, \((p,k)\)-coloring problems in line graphs
