Simultaneous separation in bounded degree trees

DOI10.1016/J.DAM.2026.02.042MaRDI QIDQ7237677zbMATH OpenFDO

Authors Sagi Snir, Raphael Yuster

Publication date 30 April 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.042

zbMATH Keywords

cutseparationtaxatrees

Mathematics Subject Classification ID

Theory of computing (68Qxx) Mathematical biology in general (92Bxx)

Cites work

• A Separator Theorem for Planar Graphs
• About groups of straight lines
• Comparison of phylogenetic trees
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 434699 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• On the compatibility of quartet trees
• On the extremal maximum agreement subtree problem
• On the maximum quartet distance between phylogenetic trees
• Reconstructing approximate phylogenetic trees from quartet samples
• Reconstructing the shape of a tree from observed dissimilarity data
• S-functions for graphs
• The complexity of reconstructing trees from qualitative characters and subtrees

This page was built for publication: Simultaneous separation in bounded degree trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237677)