The 4-Steiner Root problem

DOI10.1007/978-3-030-30786-8_2OpenAlexW2972474426MaRDI QIDQ2301532

Guillaume Ducoffe

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-30786-8_2

zbMATH Keywords

dynamic programmingmaximum matchingclique-tree\(k\)-leaf powers\(k\)-Steiner powersclique-arrangement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

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 ⋮ Unnamed Item ⋮ Parameterized leaf power recognition via embedding into graph products

This page was built for publication: The 4-Steiner Root problem