Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Broersma, H., Li, X.: Spanning Trees with Many or Few Colors in Edge-colored Graphs. Discussiones Mathematicae Graph Theory 17(2), 259–269 (1997)
2. Broersma, H., Li, X., Woeginger, G., Zhang, S.: Paths and Cycles in Colored Graphs. Australasian Journal on Combinatorics 31, 299–311 (2005)
3. Consoli, S., Moreno-Perez, J., Darby-Dowman, K., Mladenovic, N.: Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree problem. SCI, vol. 129, pp. 313–322 (2008)
4. Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.: Shared Risk Resource Group: Complexity and Approximability Issues. Parallel Processing Letters 17, 169–184 (2007)
5. Lecture Notes in Computer Science;B. Couëtoux,2008
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献