New methods to color the vertices of a graph

Scheduling Bipartite Graphs Graph Coloring Vertex Coloring Balancing Comparison Of Methods Find Maximal Cliques in General Graphs Graph Structure Np Complete Randall-Brown Algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (only showing first 100 items - show all)

Graph coloring lower bounds from decision diagrams
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
Enumeration of the partitions with minimum diameter
Graph theoretic algorithm for automatic operation sequencing for progressive die design
Backtracking algorithms for disjunctions of temporal constraints
Weighted improper colouring
Improving paper spread in examination timetables using integer programming
Symmetry breaking constraints for value symmetries in constraint satisfaction
On biconnected and fragile subgraphs of low diameter
A branch and bound algorithm for the maximum clique problem
Constructive generation of very hard 3-colorability instances
Title not available (Why is that?)
Improving the extraction and expansion method for large graph coloring
Constraint-based very large-scale neighborhood search
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths
An exact algorithm for the edge coloring by total labeling problem
Graph multi-coloring for a job scheduling application
Solving vertex coloring problems as maximum weight stable set problems
The impact of search heuristics on heavy-tailed behaviour
Worst case analysis of a graph coloring algorithm
Graph Coloring Using Eigenvalue Decomposition
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
Heuristic for rapidly four-coloring large planar graphs
On the chromatic number of \(\mathbb R^4\)
Discovering implied constraints in precedence graphs with alternatives
Constraint solving for proof planning
Graph coloring by multiagent fusion search
Chromatic scheduling and frequency assignment
Models and heuristic algorithms for a weighted vertex coloring problem
The cook-book approach to the differential equation method
Combinatorial optimization in system configuration design
Chromatic optimisation: Limitations, objectives, uses, references
Strong valid inequalities for Boolean logical pattern generation
Three new upper bounds on the chromatic number
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
An ant-based algorithm for coloring graphs
Embedding a novel objective function in a two-phased local search for robust vertex coloring
Approximate derivative computations for the gradient-based optimization methods in the local gradual deformation for history matching
Connected greedy coloring of \(H\)-free graphs
Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
Iterative coloring extension of a maximum clique
A multi-objective evolutionary algorithm for examination timetabling
Safe lower bounds for graph coloring
Privacy-preserving data splitting: a combinatorial approach
On the chromatic number of graphs
Coloring certain proximity graphs
Weighted graphs and university course timetabling
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
Co-2-plex vertex partitions
Hard-to-color graphs for connected sequential colorings
A cooperative search method for the \(k\)-coloring problem
The general \(\alpha \)-decomposition problem of fuzzy relations
Optimal direct determination of sparse Jacobian matrices
A new approach to the vertex coloring problem
A cellular memetic algorithm for the examination timetabling problem
A sequential elimination algorithm for computing bounds on the clique number of a graph
The clique-partitioning problem
A survey of graph coloring -- its types, methods and applications
An evolutionary approach for bandwidth multicoloring problems
An incremental search heuristic for coloring vertices of a graph
Hybrid evolutionary algorithm for the b-chromatic number
Average-case complexity of backtrack search for coloring sparse random graphs
An exact algorithm for the maximum stable set problem
Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
An adaptive memory algorithm for the \(k\)-coloring problem
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Generalised graph colouring by a hybrid of local search and constraint programming
An exact method for graph coloring
Almost all graphs with average degree 4 are 3-colorable
Formation control using range-only measurements
The maximum clique problem
On the use of some known methods for \(T\)-colorings of graphs
On the application of graph colouring techniques in round-robin sports scheduling
A variable neighborhood search for graph coloring.
A semidefinite programming-based heuristic for graph coloring
Routing and wavelength assignment by partition colouring
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
Towards objective measures of algorithm performance across instance space
Information-theoretic approaches to branching in search
An exact approach for the vertex coloring problem
On the recursive largest first algorithm for graph colouring
Algorithm portfolios
Some experiments with simulated annealing for coloring graphs
CsegGraph: a graph colouring instance generator
Reasoning from last conflict(s) in constraint programming
A survey of search methodologies and automated system development for examination timetabling
Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
A search space ``cartography for guiding graph coloring heuristics
Genetic and hybrid algorithms for graph coloring
Heuristics and lower bounds for the bin packing problem with conflicts
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
Recent research directions in automated timetabling
Memetic techniques for examination timetabling
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
Lower bounding techniques for DSATUR-based branch and bound
Reducing graph coloring to clique search
A multiobjective framework for heavily constrained examination timetabling problems
A new \textsf{DSATUR}-based algorithm for exact vertex coloring

This page was built for publication: New methods to color the vertices of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175306)