Parameterized leaf power recognition via embedding into graph products
From MaRDI portal
(Redirected from Publication:786044)
phylogenetic treedynamic programmingmonadic second-order logicstrong product of graphstree decompositionfixed-parameter tractableCourcelle's theoremleaf power
Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76) Logic in computer science (03B70) Parameterized complexity, tractability and kernelization (68Q27)
Recommendations
Cites work
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1059243 (Why is no real title available?)
- k-Degenerate Graphs
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Algorithms and Computation
- Bipartite roots of graphs
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Computing crossing numbers in quadratic time
- Contribution to nonserial dynamic programming
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Easy problems for tree-decomposable graphs
- Finding cactus roots in polynomial time
- Finding cut-vertices in the square roots of a graph
- Graph minors. II. Algorithmic aspects of tree-width
- Graph-Theoretic Concepts in Computer Science
- Handle-rewriting hypergraph grammars
- Hardness Results and Efficient Algorithms for Graph Powers
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Linear-time algorithms for tree root problems
- Listing all maximal cliques in sparse graphs in near-optimal time
- On graph powers for leaf-labeled trees
- On k- Versus (k + 1)-Leaf Powers
- Practical access to dynamic programming on tree decompositions
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Rooted directed path graphs are leaf powers
- S-functions for graphs
- Smallest-last ordering and clustering and graph coloring algorithms
- Some remarks about leaf roots
- Strictly chordal graphs are leaf powers
- Structure and linear time recognition of 3-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- The 3-Steiner Root Problem
- The 4-Steiner Root problem
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The square of a block graph
- Treewidth. Computations and approximations
Cited in
(9)- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- 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
- Computing optimal leaf roots of chordal cographs in linear time
- Closest 4-leaf power is fixed-parameter tractable
- Parameterized leaf power recognition via embedding into graph products
- On the treewidth of Hanoi graphs
This page was built for publication: Parameterized leaf power recognition via embedding into graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786044)
