-
Parameterized complexity of computing maximum minimal blocking and hitting sets
A blocking set in a graph G is a subset of vertices that intersects ever...
02/05/2021 ∙ by Júlio Araújo, et al. ∙
0
∙
share
read it
-
Kernelization of Maximum Minimal Vertex Cover
In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph...
02/04/2021 ∙ by Júlio Araújo, et al. ∙
0
∙
share
read it
-
Cycle convexity and the tunnel number of links
In this work, we introduce a new graph convexity, that we call Cycle Con...
12/10/2020 ∙ by Júlio Araújo, et al. ∙
0
∙
share
read it
-
On the proper orientation number of chordal graphs
An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
11/30/2020 ∙ by Júlio Araújo, et al. ∙
0
∙
share
read it
-
Dual parameterization of Weighted Coloring
Given a graph G, a proper k-coloring of G is a partition c = (S_i)_i∈ [1...
05/17/2018 ∙ by Júlio Araújo, et al. ∙
0
∙
share
read it
-
Weighted proper orientations of trees and graphs of bounded treewidth
Given a simple graph G, a weight function w:E(G)→N∖{0}, and an orientati...
04/11/2018 ∙ by Júlio Araújo, et al. ∙
0
∙
share
read it
