Algorithms and Computation
From MaRDI portal
Publication:5712129
DOI10.1007/b104582zbMath1116.68551OpenAlexW2491382297MaRDI QIDQ5712129
Rolf Niedermeier, Falk Hüffner, Michael Dom, Jiong Guo
Publication date: 22 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104582
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Structure and linear time recognition of 3-leaf powers ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Computing phylogenetic roots with bounded degrees and errors is NP-complete ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Exact leaf powers ⋮ Parameterized leaf power recognition via embedding into graph products ⋮ Simplicial Powers of Graphs ⋮ On k- Versus (k + 1)-Leaf Powers