The 3-Steiner Root Problem
From MaRDI portal
Publication:3508559
DOI10.1007/978-3-540-74839-7_11zbMath1141.68522OpenAlexW2138572249MaRDI QIDQ3508559
Publication date: 1 July 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_11
Related Items (18)
Maximal determinants of combinatorial matrices ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Towards a characterization of leaf powers by clique arrangements ⋮ Polynomial kernels for 3-leaf power graph modification 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 ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Rooted directed path graphs are leaf powers ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Unnamed Item ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ Simplicial powers of graphs ⋮ The complete inclusion structure of leaf power classes ⋮ Parameterized leaf power recognition via embedding into graph products ⋮ Simplicial Powers of Graphs ⋮ On k- Versus (k + 1)-Leaf Powers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- Counting clique trees and computing perfect elimination schemes in parallel
- Error compensation in leaf power problems
- On Graph Powers for Leaf-Labeled Trees
- Tree Powers
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Computing bounded-degree phylogenetic roots of disconnected graphs
- Linear-Time Algorithms for Tree Root Problems
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
This page was built for publication: The 3-Steiner Root Problem
