On low treewidth graphs and supertrees

DOI10.7155/JGAA.00361MaRDI QIDQ2941748zbMATH OpenOpenAlexWikidataFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Treewidth distance on phylogenetic trees
• Embedding phylogenetic trees in networks of low treewidth
• 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

Describes a project that uses

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)