An improved color coding algorithm based on hybrid architecture

被引：0
|
作者：
Wang J.-X. [1 ]
Yang Z.-B. [1 ]
Liu Y.-L. [1 ]
Chen J.-E. [1 ]
机构：
[1] School of Information Science and Engineering, Central South University
来源：
Jisuanji Xuebao/Chinese Journal of Computers | 2010年 / 33卷 / 06期
关键词：
Color coding; Divide-and-conquer; Kernelization;
D O I：
10.3724/SP.J.1016.2010.01024
中图分类号：
学科分类号：
摘要：
Color coding is a new and important technique to solve engineering hard problems. The complexity of algorithm using color coding depends on the scale of the coloring schemes, so the scale size becomes a standard to measure the color coding algorithm. Recently, the researches of color coding received many important improvements. The PH (Perfect Hashing) algorithm based on perfect hash functions constructs a scheme of size O*(6.1kn), which has been the best deterministic result for color coding so far. The PBCC (Partition-Based Color-Coding) algorithm is an effective color coding algorithm using combination thought while n≤2k. Basing on divide-and-conquer algorithm, combining with kernelization technique and using PBCC algorithm to solve sub-problem, this paper proposes a hybrid architecture based coloring algorithm HABCC (Hybrid Architecture Based Color-Coding), and proves that the coloring scheme generated by HABCC can cover all the subsets, moreover, the scheme scale satisfying |S(n,k)|≤2k·⌈ logk ⌉k-1·n. Via comparing with PH algorithm, HABCC algorithm constructs a smaller coloring scheme, which is significant to practical application of color coding technology.
引用
收藏
页码：1024 / 1031
页数：7
相关论文
共 14 条
  • [1] Alon N., Yuster R., Zwick U., Color-coding, Journal of the ACM, 42, 4, pp. 844-856, (1995)
  • [2] Monien B., How to find long paths efficiently, Annals of Discrete Mathematics, 25, pp. 239-254, (1985)
  • [3] Chen J., Lu S., Sze S., Zhang F., Improved algorithms for path, matching, and packing problems, Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 298-307, (2007)
  • [4] Wang J.-X., Liu Y.-L., Chen J.-E., An effective coloring algorithm for close relationship between the scales of element set and color set and its application, Chinese Journal of Computers, 31, 1, pp. 32-42, (2008)
  • [5] Kneis J., Molle D., Richter S., Rossmanith P., Divide-and-color, Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 58-67, (2006)
  • [6] Fredman Michael L., Janos K., Endre S., Storing a sparse table with O(1) worst case access time, Journal of the ACM, 31, 3, pp. 538-544, (1984)
  • [7] Schmidt Jeanette P., Alan S., The spatial complexity of oblivious k-probe hash functions, SIAM Journal on Computing, 19, 5, pp. 775-786, (1990)
  • [8] Bodlaender H., On linear time minor tests with depth-first search, Journal of Algorithms, 14, 1, pp. 1-23, (1993)
  • [9] Jacob S., Trey I., Karp Richard M., Roded S., Efficient algorithms for detecting signaling pathways in protein interaction networks, Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biloogy, pp. 1-13, (2005)
  • [10] Styczynski M., Jensen K., Rigoutsos I., Stephanopoulos G., An extension and novel solution to the (l, d)-motif challenge problem, Genome Informatics, 15, 2, pp. 63-71, (2004)
12