Fertin, Guillaume; Fradin, Julien; Jean, Géraldine The Maximum Colorful Arborescence problem: how (computationally) hard can it be? (English) Zbl 1477.68224 Theor. Comput. Sci. 852, 104-120 (2021). MSC: 68R10 68Q17 68Q27 68W05 68W25 PDF BibTeX XML Cite \textit{G. Fertin} et al., Theor. Comput. Sci. 852, 104--120 (2021; Zbl 1477.68224) Full Text: DOI
Dührkop, Kai; Lataretu, Marie A.; White, W. Timothy J.; Böcker, Sebastian Heuristic algorithms for the maximum colorful subtree problem. (English) Zbl 1494.92050 Parida, Laxmi (ed.) et al., 18th international workshop on algorithms in bioinformatics, WABI 2018, Helsinki, Finland, August 20–22, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 113, Article 23, 14 p. (2018). MSC: 92C40 92-08 90C59 PDF BibTeX XML Cite \textit{K. Dührkop} et al., LIPIcs -- Leibniz Int. Proc. Inform. 113, Article 23, 14 p. (2018; Zbl 1494.92050) Full Text: DOI arXiv
Fertin, Guillaume; Fradin, Julien; Jean, Géraldine Algorithmic aspects of the maximum colorful arborescence problem. (English) Zbl 1485.68181 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 216-230 (2017). MSC: 68R10 05C22 68Q25 68W05 92C40 PDF BibTeX XML Cite \textit{G. Fertin} et al., Lect. Notes Comput. Sci. 10185, 216--230 (2017; Zbl 1485.68181) Full Text: DOI