Treewidth of display graphs: bounds, brambles and applications
From MaRDI portal
Publication:5233142
DOI10.7155/jgaa.00508zbMath1419.05187arXiv1809.00907OpenAlexW2972917334MaRDI QIDQ5233142
No author found.
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.00907
Trees (05C05) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- Transforming phylogenetic networks: moving beyond tree space
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
- Reconstructing a phylogenetic level-1 network from quartets
- On the fixed parameter tractability of agreement-based phylogenetic distances
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Treewidth computations. II. Lower bounds
- Graph triangulations and the compatibility of unrooted phylogenetic trees
- Fast compatibility testing for rooted phylogenetic trees
- Compatibility of unrooted phylogenetic trees is FPT
- Treewidth computations. I: Upper bounds
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- Treewidth distance on phylogenetic trees
- Computing tree width: from theory to practice and back
- Locating a tree in a phylogenetic network
- Bounds for phylogenetic network space metrics
- Tree-based unrooted phylogenetic networks
- On compatibility and incompatibility of collections of unrooted phylogenetic trees
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Vertex and tree arboricities of graphs
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
- On the vertex-arboricity of planar graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Phylogenetic incongruence through the lens of Monadic Second Order logic
- Phylogeny
- On Low Treewidth Graphs and Supertrees
- Easy problems for tree-decomposable graphs
- An improved isomorphism test for bounded-tree-width graphs
- On Computing the Maximum Parsimony Score of a Phylogenetic Network
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Subtree transfer operations and their induced metrics on evolutionary trees
This page was built for publication: Treewidth of display graphs: bounds, brambles and applications