Abstract
In this paper, we give some basic notions concerning the st-connected vertex separator problem(st-CVS problem), then we give mathematical formula for st-CVS problem, then some special cases on some types of graphs, after then introduce an integer programming formulations for this problem. Also, we introduce a heuristic to solve this problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
