On Low Treewidth Graphs and Supertrees

DOI10.7155/jgaa.00361zbMath1325.05168OpenAlexW2592917903WikidataQ57338943 ScholiaQ57338943MaRDI QIDQ2941748

Alexander Grigoriev, Nela Lekić, Steven Kelk

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

Mathematics Subject Classification ID

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

Related Items (5)

Reduction rules for the maximum parsimony distance on phylogenetic trees ⋮ Treewidth distance on phylogenetic trees ⋮ Scanning Phylogenetic Networks Is NP-hard ⋮ On compatibility and incompatibility of collections of unrooted phylogenetic trees ⋮ Treewidth of display graphs: bounds, brambles and applications

Uses Software

• ComputeTW

This page was built for publication: On Low Treewidth Graphs and Supertrees