Author:
Zhang Peng,Fu Bin,Tang Linqing
Funder
National Natural Science Foundation of China
Natural Science Foundation of Shandong Province
Fundamental Research Funds of Shandong University
NSF Career Award
Hundred Talent Program of Chinese academy of Sciences
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ (1993)
2. Broersma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17(2), 259–269 (1997)
3. Broersma, H., Li, X., Woeginger, G., Zhang, S.: Paths and cycles in colored graphs. Australas. J. Comb. 31, 299–311 (2005)
4. Chang, R.-S., Shing-Jiuan, L.: The minimum labeling spanning trees. Inf. Process. Lett. 63(5), 277–282 (1997)
5. Consoli, S., Moreno-Pérez, J.A., Darby-Dowman, K., Mladenovic, N.: Discrete particle swarm optimization for the minimum labelling steiner tree problem. Nat. Comput. 9(1), 29–46 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献