Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. Complexity insights of the minimum duplication problem;Blin;Theoret. Comput. Sci.,2014
2. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
3. On the complexity of the maximum cut problem;Bodlaender;Nord. J. Comput.,2000
4. Spanning trees with many or few colors in edge-colored graphs;Broersma;Discuss. Math. Graph Theory,1997
5. On the red-blue set cover problem;Carr,2000
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The edge-labeled survivable network design problem: Formulations and branch-and-cut;RAIRO - Operations Research;2022-09
2. Maximum Colored Cuts in Edge-Colored Complete Graphs;Journal of Mathematics;2022-07-07
3. The Labeled Two Edge Connected Subgraph Problem;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17