14 citations · 49 across the 47 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion
Eduard Eiben, Robert Ganian, O-joung Kwon
Vertex deletion problems ask whether it is possible to delete at most vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years,…
cs.DS2016★ 9 cited
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the max…