Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

@article{Guo2008ComplexityAE,
  title={Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs},
  author={Jiong Guo and Falk H{\"u}ffner and Erhan Kenar and Rolf Niedermeier and Johannes Uhlmann},
  journal={European Journal of Operational Research},
  year={2008},
  volume={186},
  pages={542-553}
}
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainly focus on the case of removing vertices, where we distinguish between allowing or disallowing the removal of terminal vertices. Complementing and refining previous results from the literature, we provide several NP-completeness and (fixedparameter… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Bodlaender . Treewidth : Characterizations , applications , and computations

  • G. S. Lueker
  • Proc . 32 nd WG , volume 4271 of Lecture Notes in…
  • 2006

Similar Papers

Loading similar papers…