On some variants of the bandwidth minimization problem
SIAM Journal on Computing
A Multilevel Algorithm for Wavefront Reduction
SIAM Journal on Scientific Computing
The Complexity of the Approximation of the Bandwidth Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On Approximation Intractability of the Bandwidth Problem
On Approximation Intractability of the Bandwidth Problem
Note: On explicit formulas for bandwidth and antibandwidth of hypercubes
Discrete Applied Mathematics
Putting recommendations on the map: visualizing clusters and relations
Proceedings of the third ACM conference on Recommender systems
Choosing colors for geometric graphs via color space embeddings
GD'06 Proceedings of the 14th international conference on Graph drawing
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential coloring problem to that of k-Hamiltonian path. As computing the maximum differential coloring is NP-Complete, we describe an exact backtracking algorithm and a spectral-based heuristic. We also discuss lower bounds and upper bounds for the differential chromatic number for several classes of graphs.