New methods to color the vertices of a graph
From MaRDI portal
Publication:4175306
Cited in
(only showing first 100 items - show all)- An evolutionary approach for bandwidth multicoloring problems
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- The variational quantum eigensolver: a review of methods and best practices
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Hybrid evolutionary algorithm for the b-chromatic number
- An incremental search heuristic for coloring vertices of a graph
- Average-case complexity of backtrack search for coloring sparse random graphs
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- An information-based neural approach to generic constraint satisfaction.
- Constraint and satisfiability reasoning for graph coloring
- Graph coloring lower bounds from decision diagrams
- An exact algorithm for the maximum stable set problem
- Expected polynomial-time randomized algorithm for graph coloring problem
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
- Coloring Meyniel graphs in linear time
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Enumeration of the partitions with minimum diameter
- 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
- Estimating clique size by coloring the nodes of auxiliary graphs
- Accelerating backtrack search with a best-first-search strategy
- An exact method for graph coloring
- Formation control using range-only measurements
- Solving the minimum-weighted coloring problem
- The maximum clique problem
- A flow based pruning scheme for enumerative equitable coloring algorithms
- On the use of some known methods for \(T\)-colorings of graphs
- Almost all graphs with average degree 4 are 3-colorable
- Graph theoretic algorithm for automatic operation sequencing for progressive die design
- On Monte Carlo tree search for weighted vertex coloring
- Backtracking algorithms for disjunctions of temporal constraints
- Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping
- On the application of graph colouring techniques in round-robin sports scheduling
- Weighted improper colouring
- Graph coloring with decision diagrams
- A variable neighborhood search for graph coloring.
- Improving paper spread in examination timetables using integer programming
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Pickup and delivery problem with incompatibility constraints
- Fast tensor product Schwarz smoothers for high-order discontinuous Galerkin methods
- Routing and wavelength assignment by partition colouring
- A semidefinite programming-based heuristic for graph coloring
- On biconnected and fragile subgraphs of low diameter
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- Simulating Markov Random Fields With a Conclique-Based Gibbs Sampler
- Towards objective measures of algorithm performance across instance space
- A branch and bound algorithm for the maximum clique problem
- Information-theoretic approaches to branching in search
- An exact approach for the vertex coloring problem
- Constructive generation of very hard 3-colorability instances
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- SAT-boosted tabu search for coloring massive graphs
- Randomized compression of rank-structured matrices accelerated with graph coloring
- Solving the list coloring problem through a branch-and-price algorithm
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- scientific article; zbMATH DE number 1863545 (Why is no real title available?)
- Some experiments with simulated annealing for coloring graphs
- On the recursive largest first algorithm for graph colouring
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
- Algorithm portfolios
- An exact algorithm for parallel machine scheduling with conflicts
- A branch and price algorithm for list coloring problem
- CsegGraph: a graph colouring instance generator
- Constraint-based very large-scale neighborhood search
- Reasoning from last conflict(s) in constraint programming
- A survey of search methodologies and automated system development for examination timetabling
- Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths
- Matrix-free convex optimization modeling
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- An exact algorithm for the edge coloring by total labeling problem
- Eigen-stratified models
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- Complexity of coloring random graphs: an experimental study of the hardest region
- A logic approach to the resolution of constraints in timetabling
- Graph multi-coloring for a job scheduling application
- 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
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts
- Heuristics and lower bounds for the bin packing problem with conflicts
- Solving vertex coloring problems as maximum weight stable set problems
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- Variable ordering for decision diagrams: a portfolio approach
- Meta-heuristics and artificial intelligence
- The impact of search heuristics on heavy-tailed behaviour
- Worst case analysis of a graph coloring algorithm
- Vertex coloring of a graph for memory constrained scenarios
- Parallel Immune System for Graph Coloring
- Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Graph Coloring Using Eigenvalue Decomposition
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- Heuristic for rapidly four-coloring large planar graphs
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)
