Browsing Department of Informatics by Subject "Eulerian Edge Deletion"
Now showing items 1-1 of 1
-
Finding even subgraphs even faster
(Peer reviewed; Journal article, 2015)Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...