Author:
Hu Yifan,Kobourov Stephen,Veeramoni Sankar
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical Report TR98-014, University of Bonn (1998)
2. Brewer, C.: ColorBrewer - Color Advice for Maps,
http://www.colorbrewer.org
3. Calamoneri, T., Massini, A., Török, L., Vrt’o, I.: Antibandwidth of complete k-ary trees. Electronic Notes in Discrete Mathematics 24, 259–266 (2006)
4. Lecture Notes in Computer Science;M.B. Dillencourt,2007
5. Dobrev, S., Královic, R., Pardubská, D., Török, L., Vrt’o, I.: Antibandwidth and cyclic antibandwidth of hamming graphs. Electronic Notes in Discrete Mathematics 34, 295–300 (2009)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Population-based iterated greedy algorithm for the S-labeling problem;Computers & Operations Research;2023-07
2. LinSets.zip: Compressing Linear Set Diagrams;IEEE Transactions on Visualization and Computer Graphics;2023-06-01
3. Minimum gradation in greyscales of graphs;Discrete Optimization;2023-05
4. Contrast in greyscales of graphs;Journal of Combinatorial Optimization;2020-01-28
5. The maximum k -differential coloring problem;Journal of Discrete Algorithms;2017-07