Sign Up to like & get
recommendations!
0
Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0401-6
Abstract: We give a kernel with $$O(k^7)$$O(k7) vertices for Trivially Perfect Editing, the problem of adding or removing at most k edges in order to make a given graph trivially perfect. This answers in affirmative an…
read more here.
Keywords:
perfect editing;
trivially perfect;
polynomial kernel;
kernel trivially ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00777-5
Abstract: In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting…
read more here.
Keywords:
directed feedback;
polynomial kernel;
vertex set;
towards polynomial ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "Algorithmica"
DOI: 10.1007/s00453-021-00891-y
Abstract: Given a fixed graph H , the H -free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of H . We obtain a polynomial…
read more here.
Keywords:
diamond free;
polynomial kernel;
problem;
dichotomy ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2020 at "IEEE Robotics and Automation Letters"
DOI: 10.1109/lra.2019.2945240
Abstract: In this letter, we introduce a novel data-driven inverse dynamics estimator based on Gaussian Process Regression. Driven by the fact that the inverse dynamics can be described as a polynomial function on a suitable input…
read more here.
Keywords:
inspired polynomial;
inverse dynamics;
geometrically inspired;
data efficient ... See more keywords