We consider a natural generalization of Vertex Cover: the Subset Vertex ...
We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is
ℋ-subgraph-free...
In this paper, we give a very simple proof that Treewidth is NP-complete...
A graph G is H-subgraph-free if G does not contain H as a (not
necessari...
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is
ℋ-subgraph-free...
We show that Edge Multiway Cut (also called Multiterminal Cut) and Node
...
A k-role coloring alpha of a graph G is an assignment of k colors to the...