On low treewidth graphs and supertrees

DOI10.7155/JGAA.00361zbMATH Open1325.05168OpenAlexW2592917903WikidataQ57338943 ScholiaQ57338943MaRDI QIDQ2941748FDOQ2941748

Authors: Alexander Grigoriev, Steven Kelk, Nela Lekić 

Publication date: 25 August 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00361

Recommendations

• On compatibility and incompatibility of collections of unrooted phylogenetic trees
• Compatibility of unrooted phylogenetic trees is FPT
• Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (6)

• Embedding phylogenetic trees in networks of low treewidth
• Treewidth distance on phylogenetic trees
• Reduction rules for the maximum parsimony distance on phylogenetic trees
• Treewidth of display graphs: bounds, brambles and applications
• On compatibility and incompatibility of collections of unrooted phylogenetic trees
• Scanning phylogenetic networks is NP-hard

Uses Software

• ComputeTW

This page was built for publication: On low treewidth graphs and supertrees

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