A constraint programming approach to cutset problems

@article{Fages2006ACP,
  title={A constraint programming approach to cutset problems},
  author={François Fages and Akash Lal},
  journal={Computers & OR},
  year={2006},
  volume={33},
  pages={2852-2865}
}
We consider the problem of finding a cutset in a directed graph G = (V, E), i.e. a set of vertices that cuts all cycles in G. Finding a cutset of minimum cardinality is NP-hard. There exist several approximate and exact algorithms, most of them using graph reduction techniques. In this paper we propose a constraint programming approach to cutset problems and design a global constraint for computing cutsets. This cutset constraint is a global constraint over boolean variables associated to the… CONTINUE READING

Similar Papers

Loading similar papers…