Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics

@inproceedings{Ganian2011TwinCoverBV,
  title={Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics},
  author={Robert Ganian},
  booktitle={IPEC},
  year={2011}
}
Motivation Goal: solve problems which are hard on tree-width / trees. Motivation Goal: solve problems which are hard on tree-width / trees. Idea: use a more powerful parameter. Motivation Goal: solve problems which are hard on tree-width / trees. Idea: use a more powerful parameter. Motivation Why Vertex cover? It's a big hammer – solves many problems. Motivation Why Vertex cover? It's a big hammer – solves many problems. 

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…