Speedy Colorful Subtrees
From MaRDI portal
Publication:3196395
DOI10.1007/978-3-319-21398-9_25zbMath1467.92078OpenAlexW2174425372WikidataQ62048600 ScholiaQ62048600MaRDI QIDQ3196395
W. T. J. White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_25
Related Items (4)
The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? ⋮ Algorithmic Aspects of the Maximum Colorful Arborescence Problem ⋮ speedy_colorful_subtrees ⋮ Heuristic Algorithms for the Maximum Colorful Subtree Problem
Uses Software
This page was built for publication: Speedy Colorful Subtrees
