Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
Journal of Computer and System Sciences · 2026-09 · 160 · 103800
DOI: 10.1016/j.jcss.2026.103800 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2026-09. Verfasst von David Mestel und 3 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universities of the Netherlands, Dutch Research Council.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Universities of the Netherlands
- Dutch Research Council
Zitieren
APA
Mestel, D., Chaplick, S., Kelk, S., & Meuwese, R. (2026). Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. Journal of Computer and System Sciences, 160, 103800. https://doi.org/10.1016/j.jcss.2026.103800
Vancouver
Mestel D, Chaplick S, Kelk S, Meuwese R. Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. Journal of Computer and System Sciences. 2026;160:103800. doi:10.1016/j.jcss.2026.103800
BibTeX
@article{Mestel2026,
author = {Mestel, David and Chaplick, Steven and Kelk, Steven and Meuwese, Ruben},
title = {Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests},
journal = {Journal of Computer and System Sciences},
year = {2026},
volume = {160},
pages = {103800},
doi = {10.1016/j.jcss.2026.103800}
}
EUVIMED