Blar i Department of Informatics på tidsskrift "Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms"
Viser treff 1-1 av 1
-
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
(Journal article; Peer reviewed, 2020)For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and an integer k and asks whether there exists a set S ⊆ V(G) with |S| ≤ k such that G \ S does not contain any of the graphs ...