Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.68496MaRDI QIDQ5897573FDOQ5897573

Authors: Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Closest 4-leaf power is fixed-parameter tractable
• Polynomial kernels for 3-leaf power graph modification problems
• Polynomial kernels for 3-leaf power graph modification problems
• Error compensation in leaf power problems
• scientific article; zbMATH DE number 1617253

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (18)

• Polynomial kernels for 3-leaf power graph modification problems
• A more effective linear kernelization for cluster editing
• Computing and Combinatorics
• Error compensation in leaf power problems
• Recognition of linear and star variants of leaf powers is in P
• Recognizing k -Leaf Powers in Polynomial Time, for Constant k
• Pairwise compatibility graphs: a survey
• The Clique-Width of Tree-Power and Leaf-Power Graphs
• The 3-Steiner Root Problem
• A survey of parameterized algorithms and the complexity of edge modification
• Characterising \((k,\ell )\)-leaf powers
• Polynomial kernels for 3-leaf power graph modification problems
• Closest 4-leaf power is fixed-parameter tractable
• The NLC-width and clique-width for powers of graphs of bounded tree-width
• Parameterized leaf power recognition via embedding into graph products
• Parameterized leaf power recognition via embedding into graph products
• Rooted directed path graphs are leaf powers
• Algorithms and Computation

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897573)