scientific article; zbMATH DE number 4134072
From MaRDI portal
Publication:3035310
Recommendations
- scientific article; zbMATH DE number 4187836
- scientific article; zbMATH DE number 4210190
- A heuristic for the coloring of planar graphs
- Publication:4206748
- Heuristic algorithms for graph set coloring problem
- Publication:4484664
- A semidefinite programming-based heuristic for graph coloring
- A simple and fast heuristic algorithm for edge-coloring of graphs
Cited in
(35)- A search space ``cartography for guiding graph coloring heuristics
- Numerical experiences with graph coloring algorithms
- Welsh-Powell opposition graphs
- An algorithm for finding a maximum clique in a graph
- On the mean chromatic number
- Bounds for the frequency assignment problem
- A fast algorithm for the maximum clique problem
- Improving graph colouring algorithms and heuristics using a novel representation
- An incremental search heuristic for coloring vertices of a graph
- A semidefinite programming-based heuristic for graph coloring
- A hybrid heuristic for the maximum clique problem
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- Graph colouring algorithms
- An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring
- An approximation chromatic number of a graph
- Graph coloring using GPUs
- Some sequential graph colouring algorithms
- scientific article; zbMATH DE number 4210190 (Why is no real title available?)
- Greedy defining sets in graphs and Latin squares
- Randomly colorable graphs in greedy coloring
- Local optimization of colorings of graphs
- scientific article; zbMATH DE number 4127230 (Why is no real title available?)
- scientific article; zbMATH DE number 1303525 (Why is no real title available?)
- scientific article; zbMATH DE number 1944138 (Why is no real title available?)
- scientific article; zbMATH DE number 1452707 (Why is no real title available?)
- scientific article; zbMATH DE number 817188 (Why is no real title available?)
- scientific article; zbMATH DE number 227553 (Why is no real title available?)
- Heuristic algorithms for graph set coloring problem
- Evolutionary Computation in Combinatorial Optimization
- scientific article; zbMATH DE number 4187836 (Why is no real title available?)
- The mean chromatic number of paths and cycles
- An exact bit-parallel algorithm for the maximum clique problem
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- An optimal greedy heuristic to color interval graphs
- A clique algorithm for standard quadratic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035310)
