The 3-Steiner Root Problem
From MaRDI portal
Publication:3508559
Recommendations
Cites work
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- scientific article; zbMATH DE number 1796975 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Algorithms and Computation
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Computing bounded-degree phylogenetic roots of disconnected graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Error compensation in leaf power problems
- Graph-Theoretic Concepts in Computer Science
- Linear-Time Algorithms for Tree Root Problems
- On graph powers for leaf-labeled trees
- Strictly chordal graphs are leaf powers
- Structure and linear time recognition of 3-leaf powers
- Tree Powers
Cited in
(23)- Polynomial kernels for 3-leaf power graph modification problems
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Linear-time algorithms for tree root problems
- Recognition of linear and star variants of leaf powers is in P
- A polynomial kernel for 3-leaf power deletion
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Simplicial powers of graphs
- Pairwise compatibility graphs: a survey
- Lower bounds for leaf rank of leaf powers
- Characterising \((k,\ell )\)-leaf powers
- Computing optimal leaf roots of chordal cographs in linear time
- Maximal determinants of combinatorial matrices
- Closest 4-leaf power is fixed-parameter tractable
- Parameterized leaf power recognition via embedding into graph products
- On the roots of the Steiner polynomial of a 3-dimensional convex body
- The complete inclusion structure of leaf power classes
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- On k- Versus (k + 1)-Leaf Powers
- Simplicial Powers of Graphs
- Parameterized leaf power recognition via embedding into graph products
- Rooted directed path graphs are leaf powers
- Russian doll search for the Steiner triple covering problem
- Linear-Time Algorithms for Tree Root Problems
This page was built for publication: The 3-Steiner Root Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508559)
